Word Embeddings and Virtual Terms

ABSTRACT

A computing system receives a collection comprising multiple sets of ordered terms, including a first set. The system generates a dataset indicating an association between each pair of terms within a same set of the collection by generating co-occurrence score(s) for the first set. The system generates computed probabilities based on the co-occurrence score(s) for the first set. The computed probabilities indicate a likelihood that one term in a given pair of terms of the collection appears in a given set of the collection given that another term in the given pair of terms of the collection occurs. The system smoothes the computed probabilities by adding one or more random observations. The system generates one or more association indications for the first set based on the smoothed computed probabilities. The system outputs an indication of the dataset. Additionally, or alternatively, based on association measure(s), the system generates a virtual term.

RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No.62/831,693, filed Apr. 9, 2019, the disclosure of which is incorporatedherein by reference in its entirety.

BACKGROUND

Word embeddings are used in language modeling and feature learning wherewords or phrases from a list of possible terms are mapped to acontinuous vector space representing the relatedness of the words. Theseword embeddings can be useful for topic analysis (e.g., to determinefood related words). Terms of the word embeddings are typically a singleword or multiple words with a fixed distance between words (e.g., asingle phrase).

SUMMARY

In one example embodiment, a computer-program product tangibly embodiedin a non-transitory machine-readable storage medium is provided. Thecomputer-program product includes instructions operable to cause acomputing system to receive a collection comprising multiple sets ofordered terms. The multiple sets of ordered terms comprise a first set.The computer-program product includes instructions operable to cause acomputing system to generate a dataset indicating an association betweeneach pair of terms within a same set of the collection by generating oneor more co-occurrence scores for the first set. A given co-occurrencescore indicates a frequency of co-occurrence of a given pair of termswithin the first set. The computer-program product includes instructionsoperable to cause a computing system to generate a dataset indicating anassociation between each pair of terms within a same set of thecollection by generating computed probabilities based on the one or moreco-occurrence scores for the first set. Each of the computedprobabilities indicate a likelihood that one term in a given pair ofterms of the collection appears in a given set of the collection giventhat another term in the given pair of terms of the collection occurs.The computer-program product includes instructions operable to cause acomputing system to generate a dataset indicating an association betweeneach pair of terms within a same set of the collection by smoothing thecomputed probabilities by adding one or more random observations. Thecomputer-program product includes instructions operable to cause acomputing system to generate a dataset indicating an association betweeneach pair of terms within a same set of the collection by generating oneor more association indications for the first set based on the smoothedcomputed probabilities. A respective association indication of the oneor more association indications indicates an association between arespective pair of terms within the first set. The computer-programproduct includes instructions operable to cause a computing system tooutput an indication of the dataset.

In one or more embodiments, the generating the computed probabilitiesbased on the one or more co-occurrence scores for the first setcomprises computing a first weighting, and weighting a givenco-occurrence score for the first set by applying the first weighting tothe given co-occurrence score for the first set. The first weighting isone of variable weights for the first set that varies based on arespective distance between a respective pair of terms within the firstset.

In one or more embodiments, the instructions are operable to cause acomputing system to obtain a variable λ, where 0≤λ≤1; and generating thefirst weighting (w_(ij)) comprises generating:

w _(ij)=1/δ^(λ),

where δ is the distance between term i and term j of the respective pairof terms.

In one or more embodiments, the generating the computed probabilitiesbased on the one or more co-occurrence scores for the first setcomprises multiplying each of weighted co-occurrence scores of the oneor more co-occurrence scores of the first set by a constant c such thatan average of the one or more co-occurrence scores for the first setcorresponds to a value of 1.

In one or more embodiments, the smoothing the computed probabilitiescomprises: receiving a parameter from a user of the computing systemindicating a default level of random observations; adding the defaultlevel of random observations; and generating an association measurewhich is a modified normalized pointwise mutual information score basedon the smoothed computed probabilities.

In one or more embodiments, generating a given association indication ofthe one or more association indications comprises shifting anassociation measure by a variable pseudocount based on how common theterm pair is within the collection.

In one or more embodiments, the generating the one or more associationindications for the first set comprises computing an associationindication for term i and term j (A_(ij)), wherein:

$\begin{matrix}{A_{ij} = {\frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {\overset{\hat{}}{P}\left( {i,j} \right)} \right)} - \frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {{{\overset{\hat{}}{P}\left( {i,j} \right)}X_{ij}} = 0} \right)}}} & (1)\end{matrix}$

where:∥D∥ is a number of sets of ordered terms in the collection;X_(i) is a number of sets in which term i occurred in the collection;X_(j) is a number of sets in which term j occurred in the collection;m is a number of random observations;

${P_{i} = \frac{X_{i}}{D}};$ ${P_{j} = \frac{X_{j}}{D}};$

X_(ij) is a number of times terms i and j occur in the first set of thecollection; and

${\overset{\hat{}}{P}\left( {i,j} \right)} = {\frac{\left( {X_{ij} + {mP_{i}P_{j}}} \right)}{{D} + m}.}$

In one or more embodiments, the multiple sets of ordered terms furthercomprise a second set that comprises more ordered terms than the firstset.

In one or more embodiments, the instructions are operable to cause acomputing system to receive a variable parameter indicating an indicatedmaximum distance between ordered terms of a given set. A maximumdistance between ordered terms of the first set is shorter than theindicated maximum distance and a maximum distance between ordered termsof the second set is longer than the indicated maximum difference. Theinstructions are operable to cause a computing system to generate thedataset by generating one or more co-occurrence scores for the secondset. A given co-occurrence score of the one or more co-occurrence scoresfor the second set indicates a frequency of co-occurrence of a givenpair of terms within the second set within a certain distance apart setbased on the variable parameter.

In one or more embodiments, the instructions are operable to cause acomputing system to receive one or more settings for calculating thefrequency of co-occurrence of a term i and a term j within the firstset. The one or more settings comprise one or more of the followingsettings: an instruction whether to consider a particular order of theterm i and the term j; an instruction whether term i and term j can be asame term; and a maximum value for a given co-occurrence score in thefirst set. In one or more embodiments, the instructions are operable tocause a computing system to generate the one or more co-occurrencescores for the first set based on the one or more settings.

In one or more embodiments, the instructions are operable to cause acomputing system to receive a term indication to treat term variationswith equivalent stems or meanings as a same term; and generate the oneor more co-occurrence scores for the first set based on the termindication.

In one or more embodiments, the instructions are operable to cause acomputing system to output an indication of the dataset by generating asingular value decomposition (SVD) for a sparse term-by-term matrix foreach set of the collection.

In one or more embodiments, the instructions are operable to cause acomputing system to output an indication of the dataset by generatingtopic data or predictive modeling data based on a vector, or rotatedvector, resulting from the SVD.

In one or more embodiments, the instructions are operable to cause acomputing system to compute an offset table identifying a position foreach term within the collection; and compute a terms table for each setof the collection indicating each term within a respective set.Replicated terms within a row or within a column for the respective setare excluded. Generating the one or more co-occurrence scores for thefirst set comprises generating the one or more co-occurrence scores forthe first set based on the offset table and a respective terms table forthe first set.

In one or more embodiments, the collection represents text informationand terms of the multiple sets of ordered terms comprise tokens orcombinations of tokens in the text information. The instructions areoperable to cause a computing system to determine the first set based ona clause or sentence boundary in the text information.

In one or more embodiments, the instructions are operable to cause acomputing system to output an indication of the dataset by: determininga category, sentiment or meaning for the text information or a term inthe text information based on a given association indication of the oneor more association indications for the first set; and outputting thecategory, sentiment or meaning. The category, sentiment or meaning areone of predefined possible options according to a predefined modeloutcome.

In one or more embodiments, the collection represents text informationor computer-generated data. The instructions are operable to cause acomputing system to determine the first set based on locating a symbolin the collection.

In one or more embodiments, the collection represents text informationor computer-generated data associated with time information. Theinstructions are operable to cause a computing system to determine thefirst set based on a time period indicated by the time information.

In one or more embodiments, the generating the one or more co-occurrencescores for the first set comprises generating at least one co-occurrencescore between a virtual term and another term of the first set. Thevirtual term is a single term that specifies at least two terms thatco-occur a variable distance apart.

In one or more embodiments, the instructions are operable to cause acomputing system to distribute the collection across multiple computingnodes of computing nodes in a computing network to generate data ofidentified terms that occurred with the collection; receive thegenerated data of identified terms; and generate the dataset bydistributing the generated data of identified terms across a same ordifferent multiple ones of the computing nodes in the computing networksuch that an individual node of the multiple computing nodes receivesall data associated with a particular term of generated data ofidentified terms.

In another example, a computer-implemented method is provided. Thecomputer-implemented method comprises receiving a collection comprisingmultiple sets of ordered terms. The multiple sets of ordered termscomprise a first set. The computer-implemented method comprisesgenerating a dataset indicating an association between each pair ofterms within a same set of the collection by generating one or moreco-occurrence scores for the first set. A given co-occurrence scoreindicates a frequency of co-occurrence of a given pair of terms withinthe first set. The computer-implemented method comprises generating adataset indicating an association between each pair of terms within asame set of the collection by generating computed probabilities based onthe one or more co-occurrence scores for the first set. Each of thecomputed probabilities indicate a likelihood that one term in a givenpair of terms of the collection appears in a given set of the collectiongiven that another term in the given pair of terms of the collectionoccurs. The computer-implemented method comprises generating a datasetindicating an association between each pair of terms within a same setof the collection by smoothing the computed probabilities by adding oneor more random observations. The computer-implemented method comprisesgenerating a dataset indicating an association between each pair ofterms within a same set of the collection by generating one or moreassociation indications for the first set based on the smoothed computedprobabilities. A respective association indication of the one or moreassociation indications indicates an association between a respectivepair of terms within the first set. The computer-implemented methodcomprises generating a dataset indicating an association between eachpair of terms within a same set of the collection by outputting anindication of the dataset.

In one or more embodiments, the computer-implemented method comprises amethod to implement any of the instructions of the computer-programproduct as described herein.

In one or more embodiments, the generating the computed probabilitiesbased on the one or more co-occurrence scores for the first setcomprises: computing a first weighting; and weighting a givenco-occurrence score for the first set by applying the first weighting tothe given co-occurrence score for the first set. The first weighting isone of variable weights for the first set that varies based on arespective distance between a respective pair of terms within the firstset

In one or more embodiments, the computer-implemented method comprisesobtaining a variable λ, where 0≤λ≤1. The generating the first weighting(w_(ij)) comprises generating:

w _(ij)=1/δ^(λ),

where δ is the distance between term i and term j of the respective pairof terms.

In one or more embodiments, the smoothing the computed probabilitiescomprises: receiving a parameter from a user of the computing systemindicating a default level of random observations; adding the defaultlevel of random observations; and generating an association measurewhich is a modified normalized pointwise mutual information score basedon the smoothed computed probabilities.

In one or more embodiments, the generating a given associationindication of the one or more association indications comprises shiftingan association measure by a variable pseudocount based on how common theterm pair is within the collection.

In one or more embodiments, the generating the one or more associationindications for the first set comprises computing an associationindication for term i and term j (A_(ij)), according to equation (1).

In one or more embodiments, the multiple sets of ordered terms furthercomprise a second set that comprises more ordered terms than the firstset. In one or more embodiments, the computer-implemented method furthercomprises receiving a variable parameter indicating an indicated maximumdistance between ordered terms of a given set. A maximum distancebetween ordered terms of the first set is shorter than the indicatedmaximum distance, and a maximum distance between ordered terms of thesecond set is longer than the indicated maximum difference. Thegenerating the dataset comprises generating one or more co-occurrencescores for the second set. A given co-occurrence score of the one ormore co-occurrence scores for the second set indicates a frequency ofco-occurrence of a given pair of terms within the second set within acertain distance apart set based on the variable parameter.

In one or more embodiments, the computer-implemented method furthercomprises receiving one or more settings for calculating the frequencyof co-occurrence of a term i and a term j within the first set. The oneor more settings comprise one or more of the following settings: aninstruction whether to consider a particular order of the term i and theterm j; an instruction whether term i and term j can be a same term; anda maximum value for a given co-occurrence score in the first set. Thegenerating the one or more co-occurrence scores for the first setcomprises generating the one or more co-occurrence scores for the firstset based on the one or more settings.

In one or more embodiments, the outputting an indication of the datasetcomprises generating a singular value decomposition (SVD) for a sparseterm-by-term matrix for each set of the collection.

In one or more embodiments, the collection represents text informationand terms of the multiple sets of ordered terms comprise tokens orcombinations of tokens in the text information. The computer-implementedmethod further comprises determining the first set based on a clause orsentence boundary in the text information.

In another example, a computing system is provided. The computing systemincludes, but is not limited to, a processor and memory. The memorycontains instructions executable by the processor wherein the computingsystem is configured to receive a collection comprising multiple sets ofordered terms. The multiple sets of ordered terms comprise a first set.The computing system is configured to generate a dataset indicating anassociation between each pair of terms within a same set of thecollection by generating one or more co-occurrence scores for the firstset. A given co-occurrence score indicates a frequency of co-occurrenceof a given pair of terms within the first set. The computing system isconfigured to generate a dataset indicating an association between eachpair of terms within a same set of the collection by generating computedprobabilities based on the one or more co-occurrence scores for thefirst set. The computed probabilities indicate a likelihood that oneterm in a given pair of terms of the collection appears in a given setof the collection given that another term in the given pair of terms ofthe collection occurs. The computing system is configured to generate adataset indicating an association between each pair of terms within asame set of the collection by smoothing the computed probabilities byadding one or more random observations. The computing system isconfigured to generate a dataset indicating an association between eachpair of terms within a same set of the collection by generating one ormore association indications for the first set based on the smoothedcomputed probabilities. A respective association indication of the oneor more association indications indicates an association between arespective pair of terms within the first set. The computing system isconfigured to output an indication of the dataset.

In one or more embodiments, the computing system is configured toimplement any of the computer-implemented methods or instructions of thecomputer-program product as described herein.

In another example embodiment, a computer-program product tangiblyembodied in a non-transitory machine-readable storage medium. Thecomputer-program product including instructions operable to cause acomputing system to receive a dataset of a dictionary of possible terms.The dataset is for identifying one or more of the possible terms in datacomprising ordered terms. The computer-program product includinginstructions operable to cause a computing system to obtaincomputer-generated association measures. Each association measure of thecomputer-generated association measures is an association between a pairof terms from a plurality of identified terms of the possible terms thatwere identified in the data. The identified terms comprise a first termand a second term. The computer-program product including instructionsoperable to cause a computing system to, based on one or more of theobtained computer-generated association measures, generate a virtualterm. The virtual term comprises a single term that specifies the firstterm and the second term that co-occur a variable distance apart. Thecomputer-program product including instructions operable to cause acomputing system to output an indication to include the virtual term inthe dataset of possible terms.

In one or more embodiments, the instructions are operable to cause acomputing system to receive a parameter indicating a ratio of a numberof the possible terms to a number of allowed virtual terms; generate,based on the obtained computer-generated association measures, aplurality of virtual terms that exceeds the number of allowed virtualterms; and select a subset of the plurality of virtual terms. The subsetcomprises a number of selected virtual terms that is equal to or lessthan the number of allowed virtual terms.

In one or more embodiments, the instructions are operable to cause acomputing system to: compare the computer-generated associationmeasures; and select the subset based on the comparison.

In one or more embodiments, the instructions are operable to cause acomputing system to: generate, based on the obtained computer-generatedassociation measures, a plurality of virtual terms; receive a targetvariable for a supervised machine learning algorithm; and execute thesupervised machine learning algorithm to select, based on the targetvariable, a subset of the plurality of virtual terms. The subsetcomprises the virtual term. The instructions are operable to cause acomputing system to output the indication to include the subset in thedataset of possible terms.

In one or more embodiments, the instructions are operable to cause acomputing system to: generate, based on the obtained computer-generatedassociation measures, a plurality of virtual terms; determinecorrelations between individual virtual terms of the plurality ofvirtual terms and predefined topics; and select a subset of theplurality of virtual terms based on the correlations. The subsetcomprises the virtual term. The instructions are operable to cause acomputing system to output an indication to include the subset in thedataset of possible terms.

In one or more embodiments, the instructions are operable to cause acomputing system to cause a computing system to output the indicationby: comparing the computer-generated association measures of a pluralityof generated virtual terms to a threshold; and selecting virtual termsof the plurality of generated virtual terms that exceed the threshold.

In one or more embodiments, the instructions are operable to cause acomputing system to output the indication to include the virtual term inthe dataset of possible terms by: outputting a generated datasetcomprising the possible terms and the virtual term; or appending thevirtual term to the dataset of possible terms to generate the generateddataset.

In one or more embodiments, the instructions are operable to cause acomputing system to generate one or more features for the virtual term,wherein a given feature of the one or more features indicates acorrelation with one or more of a topic, category, sentiment or meaningof one of predefined possible options. The instructions are operable tocause a computing system to receive new data subsequent to the datacomprising the ordered terms. The new data comprises one or moredifferent terms or a different term ordering than the data comprisingthe ordered terms. The instructions are operable to cause a computingsystem to identify the virtual term in the new data according to thegenerated dataset; and identify one or more features about the new databased on the one or more features for the virtual term.

In one or more embodiments, the virtual term is an initial virtual term.The instructions are operable to cause a computing system to: obtain acomputer-generated association measure of an association between theinitial virtual term and another term of the generated dataset; andbased on the obtained computer-generated association measure, generatean additional virtual term that specifies the initial virtual term andthe another term that co-occurs in the data a variable distance apart.The instructions are operable to cause a computing system to output anindication to include the additional virtual term in the dataset ofpossible terms.

In one or more embodiments, the virtual term specifies more than twoterms that co-occur in the data. Additionally, or alternatively, thevirtual term specifies an ordering for the first term and the secondterm. Additionally, or alternatively, the virtual term specifies amaximum distance between the first term and the second term.Additionally, or alternatively, the first term or the second termindicates a plurality of terms of the same stem.

In one or more embodiments, the data represents text information, andthe computer-generated association measures are a measure of associationbetween each of the pairs of the plurality of identified terms of thepossible terms that were identified within a sentence of the data.

In one or more embodiments, the computer-generated association measuresare based on a frequency of co-occurrence of each pair of identifiedterms of the possible terms that were identified in the data and avariable weighting based on a distance between terms of a respectivepair of the plurality of identified terms.

In one or more embodiments, the instructions are operable to cause acomputing system to generate a virtual term by: receiving, from a userof the computing system, a user identification of the first term; anddisplaying, on a display device, candidate terms for the virtual term.The candidate terms comprise the second term. The instructions areoperable to cause a computing system to generate a virtual term byreceiving, from the user of the computing system, a user selection ofthe second term.

In one or more embodiments, the instructions are operable to cause thecomputing system to implement any of the instructions, methods oroperations of a computing system described herein.

In another example embodiment, a computer-implemented method isprovided. The computer-implemented method comprises obtaining a datasetof a dictionary of possible terms for identifying one or more of thepossible terms in data comprising ordered terms. Thecomputer-implemented method comprises obtaining computer-generatedassociation measures. Each association measure of the computer-generatedassociation measures is an association between a pair of terms from aplurality of identified terms of the possible terms that were identifiedin the data. The identified terms comprise a first term and a secondterm. The computer-implemented method comprises, based on one or more ofthe obtained computer-generated association measures, generating avirtual term. The virtual term comprises a single term that specifiesthe first term and the second term that co-occur a variable distanceapart. The computer-implemented method comprises outputting anindication to include the virtual term in the dataset of possible terms.

In one or more embodiments, the instructions are operable to cause thecomputing system to implement any of the instructions, methods oroperations of a computing system described herein.

In one or more embodiments, the computer-implemented method furthercomprises: receiving a parameter indicating a ratio of a number of thepossible terms to a number of allowed virtual terms; generating, basedon the obtained computer-generated association measures, a plurality ofvirtual terms that exceeds the number of allowed virtual terms; andselecting a subset of the plurality of virtual terms. The subsetcomprises a number of selected virtual terms that is equal to or lessthan the number of allowed virtual terms.

In one or more embodiments, the computer-implemented method furthercomprises: comparing the computer-generated association measures; andselecting the subset based on the comparison.

In one or more embodiments, the computer-implemented method furthercomprises: generating, based on the obtained computer-generatedassociation measures, a plurality of virtual terms; receiving a targetvariable for a supervised machine learning algorithm; and executing thesupervised machine learning algorithm to select, based on the targetvariable, a subset of the plurality of virtual terms. The subsetcomprises the virtual term. The computer-implemented method furthercomprises outputting the indication to include the subset in the datasetof possible terms.

In one or more embodiments, the computer-implemented method furthercomprises: generating, based on the obtained computer-generatedassociation measures, a plurality of virtual terms; determiningcorrelations between individual virtual terms of the plurality ofvirtual terms and predefined topics; and selecting a subset of theplurality of virtual terms based on the correlations. The subsetcomprises the virtual term. The computer-implemented method furthercomprises outputting an indication to include the subset in the datasetof possible terms.

In one or more embodiments, the outputting the indication comprises:comparing the computer-generated association measures of a plurality ofgenerated virtual terms to a threshold; and selecting virtual terms ofthe plurality of generated virtual terms that exceed the threshold.

In one or more embodiments, the outputting the indication comprisesincluding the virtual term in the dataset of possible terms by:outputting a generated dataset comprising the possible terms and thevirtual term; or appending the virtual term to the dataset of possibleterms to generate the generated dataset.

In one or more embodiments, the computer-implemented method furthercomprises generating one or more features for the virtual term. A givenfeature of the one or more features indicates a correlation with atopic, category, sentiment or meaning of one of predefined possibleoptions. The computer-implemented method further comprises receiving newdata subsequent to the data comprising the ordered terms. The new datacomprising one or more different terms or a different term ordering thanthe data comprising the ordered terms. The computer-implemented methodfurther comprises identifying the virtual term in the new data accordingto the generated dataset; and identifying one or more features about thenew data based on the one or more features for the virtual term.

In one or more embodiments, the virtual term is an initial virtual term.The computer-implemented method further comprises: obtaining acomputer-generated association measure of an association between theinitial virtual term and another term of the generated dataset; based onthe obtained computer-generated association measure, generating anadditional virtual term that specifies the initial virtual term and theanother term that co-occurs in the data a variable distance apart; andoutputting an indication to include the additional virtual term in thedataset of possible terms.

In one or more embodiments, the data represents text information and thecomputer-generated association measures are a measure of associationbetween each of the pairs of the plurality of identified terms of thepossible terms that were identified within a sentence of the data.

In one or more embodiments, the computer-generated association measuresare based on a frequency of co-occurrence of each pair of the identifiedterms of the possible terms that were identified in the data and avariable weighting based on a distance between terms of a respectivepair of the plurality of identified terms.

In one or more embodiments, the computer-implemented method furthercomprises generating a virtual term by: receiving, from a user of thecomputing system, a user identification of the first term; anddisplaying, on a display device, candidate terms for the virtual term.The candidate terms comprise the second term. In one or moreembodiments, the computer-implemented method further comprisesgenerating a virtual term by receiving, from the user of the computingsystem, a user selection of the second term.

In one or more embodiments, the virtual term specifies one or morespecifications. A given specification, of the one or morespecifications, specifies: more than two terms that co-occur in thedata; an ordering for the first term and the second term; or a maximumdistance between the first term and the second term.

In another example embodiment, a computing system is provided. Thecomputing system comprises, but is not limited to, a processor andmemory. The memory contains instructions executable by the processorwherein the computing system is configured to: receive a dataset of adictionary of possible terms for identifying one or more of the possibleterms in data comprising ordered terms; and obtain computer-generatedassociation measures. Each association measure of the computer-generatedassociation measures is an association between a pair of terms from aplurality of identified terms of the possible terms that were identifiedin the data. The identified terms comprise a first term and a secondterm. The memory contains instructions executable by the processorwherein the computing system is configured to: based on one or more ofthe obtained computer-generated association measures, generate a virtualterm; and output an indication to include the virtual term in thedataset of possible terms. The virtual term comprises a single term thatspecifies the first term and the second term that co-occur a variabledistance apart.

In one or more embodiments, the instructions are operable to cause thecomputing system to implement any of the instructions, methods oroperations of a computing system described herein.

Other features and aspects of example embodiments are presented below inthe Detailed Description when read in connection with the drawingspresented with this application.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a block diagram that provides an illustration of thehardware components of a computing system, according to at least oneembodiment of the present technology.

FIG. 2 illustrates an example network including an example set ofdevices communicating with each other over an exchange system and via anetwork, according to at least one embodiment of the present technology.

FIG. 3 illustrates a representation of a conceptual model of acommunications protocol system, according to at least one embodiment ofthe present technology.

FIG. 4 illustrates a communications grid computing system including avariety of control and worker nodes, according to at least oneembodiment of the present technology.

FIG. 5 illustrates a flow chart showing an example process for adjustinga communications grid or a work project in a communications grid after afailure of a node, according to at least one embodiment of the presenttechnology.

FIG. 6 illustrates a portion of a communications grid computing systemincluding a control node and a worker node, according to at least oneembodiment of the present technology.

FIG. 7 illustrates a flow chart showing an example process for executinga data analysis or processing project, according to at least oneembodiment of the present technology.

FIG. 8 illustrates a block diagram including components of an EventStream Processing Engine (ESPE), according to at least one embodiment ofthe present technology.

FIG. 9 illustrates a flow chart showing an example process includingoperations performed by an event stream processing engine, according toat least one embodiment of the present technology.

FIG. 10 illustrates an ESP system interfacing between a publishingdevice and multiple event subscribing devices, according to at least oneembodiment of the present technology.

FIG. 11 illustrates a flow chart of an example of a process forgenerating and using a machine-learning model according to at least oneembodiment of the present technology.

FIG. 12 illustrates an example of a machine-learning model as a neuralnetwork.

FIG. 13 illustrates a block diagram of a computing system for generatingassociation indications in at least one embodiment of the presenttechnology.

FIGS. 14A and 14B illustrate flow diagrams for generating associationindications in at least one embodiment of the present technology.

FIG. 15A illustrates example input data in at least one embodiment ofthe present technology.

FIG. 15B illustrates an example dictionary of possible terms in at leastone embodiment of the present technology.

FIG. 15C illustrates an example offset table in at least one embodimentof the present technology.

FIG. 16A illustrates example co-occurrence scores in at least oneembodiment of the present technology.

FIG. 16B illustrates example node input in at least one embodiment ofthe present technology.

FIG. 16C illustrates example weighted co-occurrence scores in at leastone embodiment of the present technology.

FIGS. 17A-17E illustrate example generation of association indicationsin at least one embodiment of the present technology.

FIG. 17F illustrates an example singular value decomposition in at leastone embodiment of the present technology.

FIG. 18 illustrates example generation of association indications in atleast one embodiment of the present technology.

FIG. 19 illustrates example generation of association indications in atleast one embodiment of the present technology.

FIG. 20 illustrates a block diagram of a computing system for generatingvirtual terms in at least one embodiment of the present technology.

FIG. 21 illustrates a flow diagram for generating one or more virtualterms in at least one embodiment of the present technology.

FIG. 22 illustrates a graphical user interface in at least oneembodiment of the present technology.

FIG. 23 illustrates a word embedding with a virtual term in at least oneembodiment of the present technology.

FIG. 24 illustrates computer performance improvements in embodiments ofthe present technology.

FIG. 25A illustrates text information with associated time informationin at least one embodiment of the present technology.

FIG. 25B illustrates association indications in at least one embodimentof the present technology.

FIG. 26 illustrates a block diagram of a computing device node in atleast one embodiment of the present technology.

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, specificdetails are set forth in order to provide a thorough understanding ofembodiments of the technology. However, it will be apparent that variousembodiments may be practiced without these specific details. The figuresand description are not intended to be restrictive.

The ensuing description provides example embodiments only, and is notintended to limit the scope, applicability, or configuration of thedisclosure. Rather, the ensuing description of the example embodimentswill provide those skilled in the art with an enabling description forimplementing an example embodiment. It should be understood that variouschanges may be made in the function and arrangement of elements withoutdeparting from the spirit and scope of the technology as set forth inthe appended claims.

Specific details are given in the following description to provide athorough understanding of the embodiments. However, it will beunderstood by one of ordinary skill in the art that the embodiments maybe practiced without these specific details. For example, circuits,systems, networks, processes, and other components may be shown ascomponents in block diagram form in order not to obscure the embodimentsin unnecessary detail. In other instances, well-known circuits,processes, algorithms, structures, and techniques may be shown withoutunnecessary detail in order to avoid obscuring the embodiments.

Also, it is noted that individual embodiments may be described as aprocess which is depicted as a flowchart, a flow diagram, a data flowdiagram, a structure diagram, or a block diagram. Although a flowchartmay describe the operations as a sequential process, many of theoperations can be performed in parallel or concurrently. In addition,the order of the operations may be re-arranged. A process is terminatedwhen its operations are completed, but could have additional operationsnot included in a figure. A process may correspond to a method, afunction, a procedure, a subroutine, a subprogram, etc. When a processcorresponds to a function, its termination can correspond to a return ofthe function to the calling function or the main function.

Systems depicted in some of the figures may be provided in variousconfigurations. In some embodiments, the systems may be configured as adistributed system where one or more components of the system aredistributed across one or more networks in a cloud computing system.

FIG. 1 is a block diagram that provides an illustration of the hardwarecomponents of a data transmission network 100, according to embodimentsof the present technology. Data transmission network 100 is aspecialized computer system that may be used for processing largeamounts of data where a large number of computer processing cycles arerequired.

Data transmission network 100 may also include computing environment114. Computing environment 114 may be a specialized computer or othermachine that processes the data received within the data transmissionnetwork 100. Data transmission network 100 also includes one or morenetwork devices 102. Network devices 102 may include client devices thatattempt to communicate with computing environment 114. For example,network devices 102 may send data to the computing environment 114 to beprocessed, may send signals to the computing environment 114 to controldifferent aspects of the computing environment or the data it isprocessing, among other reasons. Network devices 102 may interact withthe computing environment 114 through a number of ways, such as, forexample, over one or more networks 108. As shown in FIG. 1, computingenvironment 114 may include one or more other systems. For example,computing environment 114 may include a database system 118 and/or acommunications grid 120.

In other embodiments, network devices may provide a large amount ofdata, either all at once or streaming over a period of time (e.g., usingevent stream processing (ESP), described further with respect to FIGS.8-10), to the computing environment 114 via networks 108. For example,network devices 102 may include network computers, sensors, databases,or other devices that may transmit or otherwise provide data tocomputing environment 114. For example, network devices may includelocal area network devices, such as routers, hubs, switches, or othercomputer networking devices. These devices may provide a variety ofstored or generated data, such as network data or data specific to thenetwork devices themselves. Network devices may also include sensorsthat monitor their environment or other devices to collect dataregarding that environment or those devices, and such network devicesmay provide data they collect over time. Network devices may alsoinclude devices within the internet of things, such as devices within ahome automation network. Some of these devices may be referred to asedge devices, and may involve edge computing circuitry. Data may betransmitted by network devices directly to computing environment 114 orto network-attached data stores, such as network-attached data stores110 for storage so that the data may be retrieved later by the computingenvironment 114 or other portions of data transmission network 100.

Data transmission network 100 may also include one or morenetwork-attached data stores 110. Network-attached data stores 110 areused to store data to be processed by the computing environment 114 aswell as any intermediate or final data generated by the computing systemin non-volatile memory. However in certain embodiments, theconfiguration of the computing environment 114 allows its operations tobe performed such that intermediate and final data results can be storedsolely in volatile memory (e.g., RAM), without a requirement thatintermediate or final data results be stored to non-volatile types ofmemory (e.g., disk). This can be useful in certain situations, such aswhen the computing environment 114 receives ad hoc queries from a userand when responses, which are generated by processing large amounts ofdata, need to be generated on-the-fly. In this non-limiting situation,the computing environment 114 may be configured to retain the processedinformation within memory so that responses can be generated for theuser at different levels of detail as well as allow a user tointeractively query against this information.

Network-attached data stores may store a variety of different types ofdata organized in a variety of different ways and from a variety ofdifferent sources. For example, network-attached data storage mayinclude storage other than primary storage located within computingenvironment 114 that is directly accessible by processors locatedtherein. Network-attached data storage may include secondary, tertiaryor auxiliary storage, such as large hard drives, servers, virtualmemory, among other types. Storage devices may include portable ornon-portable storage devices, optical storage devices, and various othermediums capable of storing, containing data. A machine-readable storagemedium or computer-readable storage medium may include a non-transitorymedium in which data can be stored and that does not include carrierwaves and/or transitory electronic signals. Examples of a non-transitorymedium may include, for example, a magnetic disk or tape, opticalstorage media such as compact disk or digital versatile disk, flashmemory, memory or memory devices. A computer-program product may includecode and/or machine-executable instructions that may represent aprocedure, a function, a subprogram, a program, a routine, a subroutine,a module, a software package, a class, or any combination ofinstructions, data structures, or program statements. A code segment maybe coupled to another code segment or a hardware circuit by passingand/or receiving information, data, arguments, parameters, or memorycontents. Information, arguments, parameters, data, etc. may be passed,forwarded, or transmitted via any suitable means including memorysharing, message passing, token passing, network transmission, amongothers. Furthermore, the data stores may hold a variety of differenttypes of data. For example, network-attached data stores 110 may holdunstructured (e.g., raw) data, such as manufacturing data (e.g., adatabase containing records identifying products being manufactured withparameter data for each product, such as colors and models) or productsales databases (e.g., a database containing individual data recordsidentifying details of individual product sales).

The unstructured data may be presented to the computing environment 114in different forms such as a flat file or a conglomerate of datarecords, and may have data values and accompanying time stamps. Thecomputing environment 114 may be used to analyze the unstructured datain a variety of ways to determine the best way to structure (e.g.,hierarchically) that data, such that the structured data is tailored toa type of further analysis that a user wishes to perform on the data.For example, after being processed, the unstructured time stamped datamay be aggregated by time (e.g., into daily time period units) togenerate time series data and/or structured hierarchically according toone or more dimensions (e.g., parameters, attributes, and/or variables).For example, data may be stored in a hierarchical data structure, suchas a ROLAP OR MOLAP database, or may be stored in another tabular form,such as in a flat-hierarchy form.

Data transmission network 100 may also include one or more server farms106. Computing environment 114 may route select communications or datato the one or more sever farms 106 or one or more servers within theserver farms. Server farms 106 can be configured to provide informationin a predetermined manner. For example, server farms 106 may access datato transmit in response to a communication. Server farms 106 may beseparately housed from each other device within data transmissionnetwork 100, such as computing environment 114, and/or may be part of adevice or system.

Server farms 106 may host a variety of different types of dataprocessing as part of data transmission network 100. Server farms 106may receive a variety of different data from network devices, fromcomputing environment 114, from cloud network 116, or from othersources. The data may have been obtained or collected from one or moresensors, as inputs from a control database, or may have been received asinputs from an external system or device. Server farms 106 may assist inprocessing the data by turning raw data into processed data based on oneor more rules implemented by the server farms. For example, sensor datamay be analyzed to determine changes in an environment over time or inreal-time.

Data transmission network 100 may also include one or more cloudnetworks 116. Cloud network 116 may include a cloud infrastructuresystem that provides cloud services. In certain embodiments, servicesprovided by the cloud network 116 may include a host of services thatare made available to users of the cloud infrastructure system ondemand. Cloud network 116 is shown in FIG. 1 as being connected tocomputing environment 114 (and therefore having computing environment114 as its client or user), but cloud network 116 may be connected to orutilized by any of the devices in FIG. 1. Services provided by the cloudnetwork can dynamically scale to meet the needs of its users. The cloudnetwork 116 may include one or more computers, servers, and/or systems.In some embodiments, the computers, servers, and/or systems that make upthe cloud network 116 are different from the user's own on-premisescomputers, servers, and/or systems. For example, the cloud network 116may host an application, and a user may, via a communication networksuch as the Internet, on demand, order and use the application.

While each device, server and system in FIG. 1 is shown as a singledevice, it will be appreciated that multiple devices may instead beused. For example, a set of network devices can be used to transmitvarious communications from a single user, or remote server 140 mayinclude a server stack. As another example, data may be processed aspart of computing environment 114.

Each communication within data transmission network 100 (e.g., betweenclient devices, between a device and connection management system 150,between servers 106 and computing environment 114 or between a serverand a device) may occur over one or more networks 108. Networks 108 mayinclude one or more of a variety of different types of networks,including a wireless network, a wired network, or a combination of awired and wireless network. Examples of suitable networks include theInternet, a personal area network, a local area network (LAN), a widearea network (WAN), or a wireless local area network (WLAN). A wirelessnetwork may include a wireless interface or combination of wirelessinterfaces. As an example, a network in the one or more networks 108 mayinclude a short-range communication channel, such as a Bluetooth or aBluetooth Low Energy channel. A wired network may include a wiredinterface. The wired and/or wireless networks may be implemented usingrouters, access points, bridges, gateways, or the like, to connectdevices in the network 114, as will be further described with respect toFIG. 2. The one or more networks 108 can be incorporated entirely withinor can include an intranet, an extranet, or a combination thereof. Inone embodiment, communications between two or more systems and/ordevices can be achieved by a secure communications protocol, such assecure sockets layer (SSL) or transport layer security (TLS). Inaddition, data and/or transactional details may be encrypted.

Some aspects may utilize the Internet of Things (IoT), where things(e.g., machines, devices, phones, sensors) can be connected to networksand the data from these things can be collected and processed within thethings and/or external to the things. For example, the IoT can includesensors in many different devices, and high value analytics can beapplied to identify hidden relationships and drive increasedefficiencies. This can apply to both big data analytics and real-time(e.g., ESP) analytics. IoT may be implemented in various areas, such asfor access (technologies that get data and move it), embed-ability(devices with embedded sensors), and services. Industries in the IoTspace may automotive (connected car), manufacturing (connected factory),smart cities, energy and retail. This will be described further belowwith respect to FIG. 2.

As noted, computing environment 114 may include a communications grid120 and a transmission network database system 118. Communications grid120 may be a grid-based computing system for processing large amounts ofdata. The transmission network database system 118 may be for managing,storing, and retrieving large amounts of data that are distributed toand stored in the one or more network-attached data stores 110 or otherdata stores that reside at different locations within the transmissionnetwork database system 118. The compute nodes in the grid-basedcomputing system 120 and the transmission network database system 118may share the same processor hardware, such as processors that arelocated within computing environment 114.

FIG. 2 illustrates an example network including an example set ofdevices communicating with each other over an exchange system and via anetwork, according to embodiments of the present technology. As noted,each communication within data transmission network 100 may occur overone or more networks. System 200 includes a network device 204configured to communicate with a variety of types of client devices, forexample client devices 230, over a variety of types of communicationchannels.

As shown in FIG. 2, network device 204 can transmit a communication overa network (e.g., a cellular network via a base station 210). Thecommunication can be routed to another network device, such as networkdevices 205-209, via base station 210. The communication can also berouted to computing environment 214 via base station 210. For example,network device 204 may collect data either from its surroundingenvironment or from other network devices (such as network devices205-209) and transmit that data to computing environment 214.

Although network devices 204-209 are shown in FIG. 2 as a mobile phone,laptop computer, tablet computer, temperature sensor, motion sensor, andaudio sensor respectively, the network devices may be or include sensorsthat are sensitive to detecting aspects of their environment. Forexample, the network devices may include sensors such as water sensors,power sensors, electrical current sensors, chemical sensors, opticalsensors, pressure sensors, geographic or position sensors (e.g., GPS),velocity sensors, acceleration sensors, flow rate sensors, among others.Examples of characteristics that may be sensed include force, torque,load, strain, position, temperature, air pressure, fluid flow, chemicalproperties, resistance, electromagnetic fields, radiation, irradiance,proximity, acoustics, moisture, distance, speed, vibrations,acceleration, electrical potential, electrical current, among others.The sensors may be mounted to various components used as part of avariety of different types of systems (e.g., an oil drilling operation).The network devices may detect and record data related to theenvironment that it monitors, and transmit that data to computingenvironment 214.

As noted, one type of system that may include various sensors thatcollect data to be processed and/or transmitted to a computingenvironment according to certain embodiments includes an oil drillingsystem. For example, the one or more drilling operation sensors mayinclude surface sensors that measure a hook load, a fluid rate, atemperature and a density in and out of the wellbore, a standpipepressure, a surface torque, a rotation speed of a drill pipe, a rate ofpenetration, a mechanical specific energy, etc. and downhole sensorsthat measure a rotation speed of a bit, fluid densities, downholetorque, downhole vibration (axial, tangential, lateral), a weightapplied at a drill bit, an annular pressure, a differential pressure, anazimuth, an inclination, a dog leg severity, a measured depth, avertical depth, a downhole temperature, etc. Besides the raw datacollected directly by the sensors, other data may include parameterseither developed by the sensors or assigned to the system by a client orother controlling device. For example, one or more drilling operationcontrol parameters may control settings such as a mud motor speed toflow ratio, a bit diameter, a predicted formation top, seismic data,weather data, etc. Other data may be generated using physical modelssuch as an earth model, a weather model, a seismic model, a bottom holeassembly model, a well plan model, an annular friction model, etc. Inaddition to sensor and control settings, predicted outputs, of forexample, the rate of penetration, mechanical specific energy, hook load,flow in fluid rate, flow out fluid rate, pump pressure, surface torque,rotation speed of the drill pipe, annular pressure, annular frictionpressure, annular temperature, equivalent circulating density, etc. mayalso be stored in the data warehouse.

In another example, another type of system that may include varioussensors that collect data to be processed and/or transmitted to acomputing environment according to certain embodiments includes a homeautomation or similar automated network in a different environment, suchas an office space, school, public space, sports venue, or a variety ofother locations. Network devices in such an automated network mayinclude network devices that allow a user to access, control, and/orconfigure various home appliances located within the user's home (e.g.,a television, radio, light, fan, humidifier, sensor, microwave, iron,and/or the like), or outside of the user's home (e.g., exterior motionsensors, exterior lighting, garage door openers, sprinkler systems, orthe like). For example, network device 102 may include a home automationswitch that may be coupled with a home appliance. In another embodiment,a network device can allow a user to access, control, and/or configuredevices, such as office-related devices (e.g., copy machine, printer, orfax machine), audio and/or video related devices (e.g., a receiver, aspeaker, a projector, a DVD player, or a television), media-playbackdevices (e.g., a compact disc player, a CD player, or the like),computing devices (e.g., a home computer, a laptop computer, a tablet, apersonal digital assistant (PDA), a computing device, or a wearabledevice), lighting devices (e.g., a lamp or recessed lighting), devicesassociated with a security system, devices associated with an alarmsystem, devices that can be operated in an automobile (e.g., radiodevices, navigation devices), and/or the like. Data may be collectedfrom such various sensors in raw form, or data may be processed by thesensors to create parameters or other data either developed by thesensors based on the raw data or assigned to the system by a client orother controlling device.

In another example, another type of system that may include varioussensors that collect data to be processed and/or transmitted to acomputing environment according to certain embodiments includes a poweror energy grid. A variety of different network devices may be includedin an energy grid, such as various devices within one or more powerplants, energy farms (e.g., wind farm, solar farm, among others) energystorage facilities, factories, homes and businesses of consumers, amongothers. One or more of such devices may include one or more sensors thatdetect energy gain or loss, electrical input or output or loss, and avariety of other efficiencies. These sensors may collect data to informusers of how the energy grid, and individual devices within the grid,may be functioning and how they may be made more efficient.

Network device sensors may also perform processing on data it collectsbefore transmitting the data to the computing environment 114, or beforedeciding whether to transmit data to the computing environment 114. Forexample, network devices may determine whether data collected meetscertain rules, for example by comparing data or values calculated fromthe data and comparing that data to one or more thresholds. The networkdevice may use this data and/or comparisons to determine if the datashould be transmitted to the computing environment 214 for further useor processing.

Computing environment 214 may include machines 220 and 240. Althoughcomputing environment 214 is shown in FIG. 2 as having two machines, 220and 240, computing environment 214 may have only one machine or may havemore than two machines. The machines that make up computing environment214 may include specialized computers, servers, or other machines thatare configured to individually and/or collectively process large amountsof data. The computing environment 214 may also include storage devicesthat include one or more databases of structured data, such as dataorganized in one or more hierarchies, or unstructured data. Thedatabases may communicate with the processing devices within computingenvironment 214 to distribute data to them. Since network devices maytransmit data to computing environment 214, that data may be received bythe computing environment 214 and subsequently stored within thosestorage devices. Data used by computing environment 214 may also bestored in data stores 235, which may also be a part of or connected tocomputing environment 214.

Computing environment 214 can communicate with various devices via oneor more routers 225 or other inter-network or intra-network connectioncomponents. For example, computing environment 214 may communicate withdevices 230 via one or more routers 225. Computing environment 214 maycollect, analyze and/or store data from or pertaining to communications,client device operations, client rules, and/or user-associated actionsstored at one or more data stores 235. Such data may influencecommunication routing to the devices within computing environment 214,how data is stored or processed within computing environment 214, amongother actions.

Notably, various other devices can further be used to influencecommunication routing and/or processing between devices within computingenvironment 214 and with devices outside of computing environment 214.For example, as shown in FIG. 2, computing environment 214 may include aweb server 240. Thus, computing environment 214 can retrieve data ofinterest, such as client information (e.g., product information, clientrules, etc.), technical product details, news, current or predictedweather, and so on.

In addition to computing environment 214 collecting data (e.g., asreceived from network devices, such as sensors, and client devices orother sources) to be processed as part of a big data analytics project,it may also receive data in real time as part of a streaming analyticsenvironment. As noted, data may be collected using a variety of sourcesas communicated via different kinds of networks or locally. Such datamay be received on a real-time streaming basis. For example, networkdevices may receive data periodically from network device sensors as thesensors continuously sense, monitor and track changes in theirenvironments. Devices within computing environment 214 may also performpre-analysis on data it receives to determine if the data receivedshould be processed as part of an ongoing project. The data received andcollected by computing environment 214, no matter what the source ormethod or timing of receipt, may be processed over a period of time fora client to determine results data based on the client's needs andrules.

FIG. 3 illustrates a representation of a conceptual model of acommunications protocol system, according to embodiments of the presenttechnology. More specifically, FIG. 3 identifies operation of acomputing environment in an Open Systems Interaction model thatcorresponds to various connection components. The model 300 shows, forexample, how a computing environment, such as computing environment 314(or computing environment 214 in FIG. 2) may communicate with otherdevices in its network, and control how communications between thecomputing environment and other devices are executed and under whatconditions.

The model can include layers 302-314. The layers are arranged in astack. Each layer in the stack serves the layer one level higher than it(except for the application layer, which is the highest layer), and isserved by the layer one level below it (except for the physical layer,which is the lowest layer). The physical layer is the lowest layerbecause it receives and transmits raw bites of data, and is the farthestlayer from the user in a communications system. On the other hand, theapplication layer is the highest layer because it interacts directlywith a software application.

As noted, the model includes a physical layer 302. Physical layer 302represents physical communication, and can define parameters of thatphysical communication. For example, such physical communication maycome in the form of electrical, optical, or electromagnetic signals.Physical layer 302 also defines protocols that may controlcommunications within a data transmission network.

Link layer 304 defines links and mechanisms used to transmit (i.e.,move) data across a network. The link layer manages node-to-nodecommunications, such as within a grid computing environment. Link layer304 can detect and correct errors (e.g., transmission errors in thephysical layer 302). Link layer 304 can also include a media accesscontrol (MAC) layer and logical link control (LLC) layer.

Network layer 306 defines the protocol for routing within a network. Inother words, the network layer coordinates transferring data acrossnodes in a same network (e.g., such as a grid computing environment).Network layer 306 can also define the processes used to structure localaddressing within the network.

Transport layer 308 can manage the transmission of data and the qualityof the transmission and/or receipt of that data. Transport layer 308 canprovide a protocol for transferring data, such as, for example, aTransmission Control Protocol (TCP). Transport layer 308 can assembleand disassemble data frames for transmission. The transport layer canalso detect transmission errors occurring in the layers below it.

Session layer 310 can establish, maintain, and manage communicationconnections between devices on a network. In other words, the sessionlayer controls the dialogues or nature of communications between networkdevices on the network. The session layer may also establishcheckpointing, adjournment, termination, and restart procedures.

Presentation layer 312 can provide translation for communicationsbetween the application and network layers. In other words, this layermay encrypt, decrypt and/or format data based on data types known to beaccepted by an application or network layer.

Application layer 314 interacts directly with software applications andend users, and manages communications between them. Application layer314 can identify destinations, local resource states or availabilityand/or communication content or formatting using the applications.

Intra-network connection components 322 and 324 are shown to operate inlower levels, such as physical layer 302 and link layer 304,respectively. For example, a hub can operate in the physical layer, aswitch can operate in the physical layer, and a router can operate inthe network layer. Inter-network connection components 326 and 328 areshown to operate on higher levels, such as layers 306-314. For example,routers can operate in the network layer and network devices can operatein the transport, session, presentation, and application layers.

As noted, a computing environment 314 can interact with and/or operateon, in various embodiments, one, more, all or any of the various layers.For example, computing environment 314 can interact with a hub (e.g.,via the link layer) so as to adjust which devices the hub communicateswith. The physical layer may be served by the link layer, so it mayimplement such data from the link layer. For example, the computingenvironment 314 may control which devices it will receive data from. Forexample, if the computing environment 314 knows that a certain networkdevice has turned off, broken, or otherwise become unavailable orunreliable, the computing environment 314 may instruct the hub toprevent any data from being transmitted to the computing environment 314from that network device. Such a process may be beneficial to avoidreceiving data that is inaccurate or that has been influenced by anuncontrolled environment. As another example, computing environment 314can communicate with a bridge, switch, router or gateway and influencewhich device within the system (e.g., system 200) the component selectsas a destination. In some embodiments, computing environment 314 caninteract with various layers by exchanging communications with equipmentoperating on a particular layer by routing or modifying existingcommunications. In another embodiment, such as in a grid computingenvironment, a node may determine how data within the environment shouldbe routed (e.g., which node should receive certain data) based oncertain parameters or information provided by other layers within themodel.

As noted, the computing environment 314 may be a part of acommunications grid environment, the communications of which may beimplemented as shown in the protocol of FIG. 3. For example, referringback to FIG. 2, one or more of machines 220 and 240 may be part of acommunications grid computing environment. A gridded computingenvironment may be employed in a distributed system with non-interactiveworkloads where data resides in memory on the machines, or computenodes. In such an environment, analytic code, instead of a databasemanagement system, controls the processing performed by the nodes. Datais co-located by pre-distributing it to the grid nodes, and the analyticcode on each node loads the local data into memory. Each node may beassigned a particular task such as a portion of a processing project, orto organize or control other nodes within the grid.

FIG. 4 illustrates a communications grid computing system 400 includinga variety of control and worker nodes, according to embodiments of thepresent technology. Communications grid computing system 400 includesthree control nodes and one or more worker nodes. Communications gridcomputing system 400 includes control nodes 402, 404, and 406. Thecontrol nodes are communicatively connected via communication paths 451,453, and 455. Therefore, the control nodes may transmit information(e.g., related to the communications grid or notifications), to andreceive information from each other. Although communications gridcomputing system 400 is shown in FIG. 4 as including three controlnodes, the communications grid may include more or less than threecontrol nodes.

Communications grid computing system (or just “communications grid”) 400also includes one or more worker nodes. Shown in FIG. 4 are six workernodes 410-420. Although FIG. 4 shows six worker nodes, a communicationsgrid according to embodiments of the present technology may include moreor less than six worker nodes. The number of worker nodes included in acommunications grid may be dependent upon how large the project or dataset is being processed by the communications grid, the capacity of eachworker node, the time designated for the communications grid to completethe project, among others. Each worker node within the communicationsgrid 400 may be connected (wired or wirelessly, and directly orindirectly) to control nodes 402-406. Therefore, each worker node mayreceive information from the control nodes (e.g., an instruction toperform work on a project) and may transmit information to the controlnodes (e.g., a result from work performed on a project). Furthermore,worker nodes may communicate with each other (either directly orindirectly). For example, worker nodes may transmit data between eachother related to a job being performed or an individual task within ajob being performed by that worker node. However, in certainembodiments, worker nodes may not, for example, be connected(communicatively or otherwise) to certain other worker nodes. In anembodiment, worker nodes may only be able to communicate with thecontrol node that controls it, and may not be able to communicate withother worker nodes in the communications grid, whether they are otherworker nodes controlled by the control node that controls the workernode, or worker nodes that are controlled by other control nodes in thecommunications grid.

A control node may connect with an external device with which thecontrol node may communicate (e.g., a grid user, such as a server orcomputer, may connect to a controller of the grid). For example, aserver or computer may connect to control nodes and may transmit aproject or job to the node. The project may include a data set. The dataset may be of any size. Once the control node receives such a projectincluding a large data set, the control node may distribute the data setor projects related to the data set to be performed by worker nodes.Alternatively, for a project including a large data set, the data setmay be receive or stored by a machine other than a control node (e.g., aHadoop data node).

Control nodes may maintain knowledge of the status of the nodes in thegrid (i.e., grid status information), accept work requests from clients,subdivide the work across worker nodes, coordinate the worker nodes,among other responsibilities. Worker nodes may accept work requests froma control node and provide the control node with results of the workperformed by the worker node. A grid may be started from a single node(e.g., a machine, computer, server, etc.). This first node may beassigned or may start as the primary control node that will control anyadditional nodes that enter the grid.

When a project is submitted for execution (e.g., by a client or acontroller of the grid) it may be assigned to a set of nodes. After thenodes are assigned to a project, a data structure (i.e., a communicator)may be created. The communicator may be used by the project forinformation to be shared between the project code running on each node.A communication handle may be created on each node. A handle, forexample, is a reference to the communicator that is valid within asingle process on a single node, and the handle may be used whenrequesting communications between nodes.

A control node, such as control node 402, may be designated as theprimary control node. A server, computer or other external device mayconnect to the primary control node. Once the control node receives aproject, the primary control node may distribute portions of the projectto its worker nodes for execution. For example, when a project isinitiated on communications grid 400, primary control node 402 controlsthe work to be performed for the project in order to complete theproject as requested or instructed. The primary control node maydistribute work to the worker nodes based on various factors, such aswhich subsets or portions of projects may be completed most efficientlyand in the correct amount of time. For example, a worker node mayperform analysis on a portion of data that is already local (e.g.,stored on) the worker node. The primary control node also coordinatesand processes the results of the work performed by each worker nodeafter each worker node executes and completes its job. For example, theprimary control node may receive a result from one or more worker nodes,and the control node may organize (e.g., collect and assemble) theresults received and compile them to produce a complete result for theproject received from the end user.

Any remaining control nodes, such as control nodes 404 and 406, may beassigned as backup control nodes for the project. In an embodiment,backup control nodes may not control any portion of the project.Instead, backup control nodes may serve as a backup for the primarycontrol node and take over as primary control node if the primarycontrol node were to fail. If a communications grid were to include onlya single control node, and the control node were to fail (e.g., thecontrol node is shut off or breaks) then the communications grid as awhole may fail and any project or job being run on the communicationsgrid may fail and may not complete. While the project may be run again,such a failure may cause a delay (severe delay in some cases, such asovernight delay) in completion of the project. Therefore, a grid withmultiple control nodes, including a backup control node, may bebeneficial.

To add another node or machine to the grid, the primary control node mayopen a pair of listening sockets, for example. A socket may be used toaccept work requests from clients, and the second socket may be used toaccept connections from other grid nodes). The primary control node maybe provided with a list of other nodes (e.g., other machines, computers,servers) that will participate in the grid, and the role that each nodewill fill in the grid. Upon startup of the primary control node (e.g.,the first node on the grid), the primary control node may use a networkprotocol to start the server process on every other node in the grid.Command line parameters, for example, may inform each node of one ormore pieces of information, such as: the role that the node will have inthe grid, the host name of the primary control node, the port number onwhich the primary control node is accepting connections from peer nodes,among others. The information may also be provided in a configurationfile, transmitted over a secure shell tunnel, recovered from aconfiguration server, among others. While the other machines in the gridmay not initially know about the configuration of the grid, thatinformation may also be sent to each other node by the primary controlnode. Updates of the grid information may also be subsequently sent tothose nodes.

For any control node other than the primary control node added to thegrid, the control node may open three sockets. The first socket mayaccept work requests from clients, the second socket may acceptconnections from other grid members, and the third socket may connect(e.g., permanently) to the primary control node. When a control node(e.g., primary control node) receives a connection from another controlnode, it first checks to see if the peer node is in the list ofconfigured nodes in the grid. If it is not on the list, the control nodemay clear the connection. If it is on the list, it may then attempt toauthenticate the connection. If authentication is successful, theauthenticating node may transmit information to its peer, such as theport number on which a node is listening for connections, the host nameof the node, information about how to authenticate the node, among otherinformation. When a node, such as the new control node, receivesinformation about another active node, it will check to see if italready has a connection to that other node. If it does not have aconnection to that node, it may then establish a connection to thatcontrol node.

Any worker node added to the grid may establish a connection to theprimary control node and any other control nodes on the grid. Afterestablishing the connection, it may authenticate itself to the grid(e.g., any control nodes, including both primary and backup, or a serveror user controlling the grid). After successful authentication, theworker node may accept configuration information from the control node.

When a node joins a communications grid (e.g., when the node is poweredon or connected to an existing node on the grid or both), the node isassigned (e.g., by an operating system of the grid) a universally uniqueidentifier (UUID). This unique identifier may help other nodes andexternal entities (devices, users, etc.) to identify the node anddistinguish it from other nodes. When a node is connected to the grid,the node may share its unique identifier with the other nodes in thegrid. Since each node may share its unique identifier, each node mayknow the unique identifier of every other node on the grid. Uniqueidentifiers may also designate a hierarchy of each of the nodes (e.g.,backup control nodes) within the grid. For example, the uniqueidentifiers of each of the backup control nodes may be stored in a listof backup control nodes to indicate an order in which the backup controlnodes will take over for a failed primary control node to become a newprimary control node. However, a hierarchy of nodes may also bedetermined using methods other than using the unique identifiers of thenodes. For example, the hierarchy may be predetermined, or may beassigned based on other predetermined factors.

The grid may add new machines at any time (e.g., initiated from anycontrol node). Upon adding a new node to the grid, the control node mayfirst add the new node to its table of grid nodes. The control node mayalso then notify every other control node about the new node. The nodesreceiving the notification may acknowledge that they have updated theirconfiguration information.

Primary control node 402 may, for example, transmit one or morecommunications to backup control nodes 404 and 406 (and, for example, toother control or worker nodes within the communications grid). Suchcommunications may sent periodically, at fixed time intervals, betweenknown fixed stages of the project's execution, among other protocols.The communications transmitted by primary control node 402 may be ofvaried types and may include a variety of types of information. Forexample, primary control node 402 may transmit snapshots (e.g., statusinformation) of the communications grid so that backup control node 404always has a recent snapshot of the communications grid. The snapshot orgrid status may include, for example, the structure of the grid(including, for example, the worker nodes in the grid, uniqueidentifiers of the nodes, or their relationships with the primarycontrol node) and the status of a project (including, for example, thestatus of each worker node's portion of the project). The snapshot mayalso include analysis or results received from worker nodes in thecommunications grid. The backup control nodes may receive and store thebackup data received from the primary control node. The backup controlnodes may transmit a request for such a snapshot (or other information)from the primary control node, or the primary control node may send suchinformation periodically to the backup control nodes.

As noted, the backup data may allow the backup control node to take overas primary control node if the primary control node fails withoutrequiring the grid to start the project over from scratch. If theprimary control node fails, the backup control node that will take overas primary control node may retrieve the most recent version of thesnapshot received from the primary control node and use the snapshot tocontinue the project from the stage of the project indicated by thebackup data. This may prevent failure of the project as a whole.

A backup control node may use various methods to determine that theprimary control node has failed. In one example of such a method, theprimary control node may transmit (e.g., periodically) a communicationto the backup control node that indicates that the primary control nodeis working and has not failed, such as a heartbeat communication. Thebackup control node may determine that the primary control node hasfailed if the backup control node has not received a heartbeatcommunication for a certain predetermined period of time. Alternatively,a backup control node may also receive a communication from the primarycontrol node itself (before it failed) or from a worker node that theprimary control node has failed, for example because the primary controlnode has failed to communicate with the worker node.

Different methods may be performed to determine which backup controlnode of a set of backup control nodes (e.g., backup control nodes 404and 406) will take over for failed primary control node 402 and becomethe new primary control node. For example, the new primary control nodemay be chosen based on a ranking or “hierarchy” of backup control nodesbased on their unique identifiers. In an alternative embodiment, abackup control node may be assigned to be the new primary control nodeby another device in the communications grid or from an external device(e.g., a system infrastructure or an end user, such as a server orcomputer, controlling the communications grid). In another alternativeembodiment, the backup control node that takes over as the new primarycontrol node may be designated based on bandwidth or other statisticsabout the communications grid.

A worker node within the communications grid may also fail. If a workernode fails, work being performed by the failed worker node may beredistributed amongst the operational worker nodes. In an alternativeembodiment, the primary control node may transmit a communication toeach of the operable worker nodes still on the communications grid thateach of the worker nodes should purposefully fail also. After each ofthe worker nodes fail, they may each retrieve their most recent savedcheckpoint of their status and re-start the project from that checkpointto minimize lost progress on the project being executed.

FIG. 5 illustrates a flow chart showing an example process for adjustinga communications grid or a work project in a communications grid after afailure of a node, according to embodiments of the present technology.The process may include, for example, receiving grid status informationincluding a project status of a portion of a project being executed by anode in the communications grid, as described in operation 502. Forexample, a control node (e.g., a backup control node connected to aprimary control node and a worker node on a communications grid) mayreceive grid status information, where the grid status informationincludes a project status of the primary control node or a projectstatus of the worker node. The project status of the primary controlnode and the project status of the worker node may include a status ofone or more portions of a project being executed by the primary andworker nodes in the communications grid. The process may also includestoring the grid status information, as described in operation 504. Forexample, a control node (e.g., a backup control node) may store thereceived grid status information locally within the control node.Alternatively, the grid status information may be sent to another devicefor storage where the control node may have access to the information.

The process may also include receiving a failure communicationcorresponding to a node in the communications grid in operation 506. Forexample, a node may receive a failure communication including anindication that the primary control node has failed, prompting a backupcontrol node to take over for the primary control node. In analternative embodiment, a node may receive a failure that a worker nodehas failed, prompting a control node to reassign the work beingperformed by the worker node. The process may also include reassigning anode or a portion of the project being executed by the failed node, asdescribed in operation 508. For example, a control node may designatethe backup control node as a new primary control node based on thefailure communication upon receiving the failure communication. If thefailed node is a worker node, a control node may identify a projectstatus of the failed worker node using the snapshot of thecommunications grid, where the project status of the failed worker nodeincludes a status of a portion of the project being executed by thefailed worker node at the failure time.

The process may also include receiving updated grid status informationbased on the reassignment, as described in operation 510, andtransmitting a set of instructions based on the updated grid statusinformation to one or more nodes in the communications grid, asdescribed in operation 512. The updated grid status information mayinclude an updated project status of the primary control node or anupdated project status of the worker node. The updated information maybe transmitted to the other nodes in the grid to update their stalestored information.

FIG. 6 illustrates a portion of a communications grid computing system600 including a control node and a worker node, according to embodimentsof the present technology. Communications grid 600 computing systemincludes one control node (control node 602) and one worker node (workernode 610) for purposes of illustration, but may include more workerand/or control nodes. The control node 602 is communicatively connectedto worker node 610 via communication path 650. Therefore, control node602 may transmit information (e.g., related to the communications gridor notifications), to and receive information from worker node 610 viapath 650.

Similar to in FIG. 4, communications grid computing system (or just“communications grid”) 600 includes data processing nodes (control node602 and worker node 610). Nodes 602 and 610 include multi-core dataprocessors. Each node 602 and 610 includes a grid-enabled softwarecomponent (GESC) 620 that executes on the data processor associated withthat node and interfaces with buffer memory 622 also associated withthat node. Each node 602 and 610 includes a database management software(DBMS) 628 that executes on a database server (not shown) at controlnode 602 and on a database server (not shown) at worker node 610.

Each node also includes a data store 624. Data stores 624, similar tonetwork-attached data stores 110 in FIG. 1 and data stores 235 in FIG.2, are used to store data to be processed by the nodes in the computingenvironment. Data stores 624 may also store any intermediate or finaldata generated by the computing system after being processed, forexample in non-volatile memory. However in certain embodiments, theconfiguration of the grid computing environment allows its operations tobe performed such that intermediate and final data results can be storedsolely in volatile memory (e.g., RAM), without a requirement thatintermediate or final data results be stored to non-volatile types ofmemory. Storing such data in volatile memory may be useful in certainsituations, such as when the grid receives queries (e.g., ad hoc) from aclient and when responses, which are generated by processing largeamounts of data, need to be generated quickly or on-the-fly. In such asituation, the grid may be configured to retain the data within memoryso that responses can be generated at different levels of detail and sothat a client may interactively query against this information.

Each node also includes a user-defined function (UDF) 626. The UDFprovides a mechanism for the DMBS 628 to transfer data to or receivedata from the database stored in the data stores 624 that are managed bythe DBMS. For example, UDF 626 can be invoked by the DBMS to providedata to the GESC for processing. The UDF 626 may establish a socketconnection (not shown) with the GESC to transfer the data.Alternatively, the UDF 626 can transfer data to the GESC by writing datato shared memory accessible by both the UDF and the GESC.

The GESC 620 at the nodes 602 and 620 may be connected via a network,such as network 108 shown in FIG. 1. Therefore, nodes 602 and 620 cancommunicate with each other via the network using a predeterminedcommunication protocol such as, for example, the Message PassingInterface (MPI). Each GESC 620 can engage in point-to-pointcommunication with the GESC at another node or in collectivecommunication with multiple GESCs via the network. The GESC 620 at eachnode may contain identical (or nearly identical) software instructions.Each node may be capable of operating as either a control node or aworker node. The GESC at the control node 602 can communicate, over acommunication path 652, with a client device 630. More specifically,control node 602 may communicate with client application 632 hosted bythe client device 630 to receive queries and to respond to those queriesafter processing large amounts of data.

DMBS 628 may control the creation, maintenance, and use of database ordata structure (not shown) within a nodes 602 or 610. The database mayorganize data stored in data stores 624. The DMBS 628 at control node602 may accept requests for data and transfer the appropriate data forthe request. With such a process, collections of data may be distributedacross multiple physical locations. In this example, each node 602 and610 stores a portion of the total data managed by the management systemin its associated data store 624.

Furthermore, the DBMS may be responsible for protecting against dataloss using replication techniques. Replication includes providing abackup copy of data stored on one node on one or more other nodes.Therefore, if one node fails, the data from the failed node can berecovered from a replicated copy residing at another node. However, asdescribed herein with respect to FIG. 4, data or status information foreach node in the communications grid may also be shared with each nodeon the grid.

FIG. 7 illustrates a flow chart showing an example method for executinga project within a grid computing system, according to embodiments ofthe present technology. As described with respect to FIG. 6, the GESC atthe control node may transmit data with a client device (e.g., clientdevice 630) to receive queries for executing a project and to respond tothose queries after large amounts of data have been processed. The querymay be transmitted to the control node, where the query may include arequest for executing a project, as described in operation 702. Thequery can contain instructions on the type of data analysis to beperformed in the project and whether the project should be executedusing the grid-based computing environment, as shown in operation 704.

To initiate the project, the control node may determine if the queryrequests use of the grid-based computing environment to execute theproject. If the determination is no, then the control node initiatesexecution of the project in a solo environment (e.g., at the controlnode), as described in operation 710. If the determination is yes, thecontrol node may initiate execution of the project in the grid-basedcomputing environment, as described in operation 706. In such asituation, the request may include a requested configuration of thegrid. For example, the request may include a number of control nodes anda number of worker nodes to be used in the grid when executing theproject. After the project has been completed, the control node maytransmit results of the analysis yielded by the grid, as described inoperation 708. Whether the project is executed in a solo or grid-basedenvironment, the control node provides the results of the project.

As noted with respect to FIG. 2, the computing environments describedherein may collect data (e.g., as received from network devices, such assensors, such as network devices 204-209 in FIG. 2, and client devicesor other sources) to be processed as part of a data analytics project,and data may be received in real time as part of a streaming analyticsenvironment (e.g., ESP). Data may be collected using a variety ofsources as communicated via different kinds of networks or locally, suchas on a real-time streaming basis. For example, network devices mayreceive data periodically from network device sensors as the sensorscontinuously sense, monitor and track changes in their environments.More specifically, an increasing number of distributed applicationsdevelop or produce continuously flowing data from distributed sources byapplying queries to the data before distributing the data togeographically distributed recipients. An event stream processing engine(ESPE) may continuously apply the queries to the data as it is receivedand determines which entities should receive the data. Client or otherdevices may also subscribe to the ESPE or other devices processing ESPdata so that they can receive data after processing, based on forexample the entities determined by the processing engine. For example,client devices 230 in FIG. 2 may subscribe to the ESPE in computingenvironment 214. In another example, event subscription devices 1024a-c, described further with respect to FIG. 10, may also subscribe tothe ESPE. The ESPE may determine or define how input data or eventstreams from network devices or other publishers (e.g., network devices204-209 in FIG. 2) are transformed into meaningful output data to beconsumed by subscribers, such as for example client devices 230 in FIG.2.

FIG. 8 illustrates a block diagram including components of an EventStream Processing Engine (ESPE), according to embodiments of the presenttechnology. ESPE 800 may include one or more projects 802. A project maybe described as a second-level container in an engine model managed byESPE 800 where a thread pool size for the project may be defined by auser. Each project of the one or more projects 802 may include one ormore continuous queries 804 that contain data flows, which are datatransformations of incoming event streams. The one or more continuousqueries 804 may include one or more source windows 806 and one or morederived windows 808.

The ESPE may receive streaming data over a period of time related tocertain events, such as events or other data sensed by one or morenetwork devices. The ESPE may perform operations associated withprocessing data created by the one or more devices. For example, theESPE may receive data from the one or more network devices 204-209 shownin FIG. 2. As noted, the network devices may include sensors that sensedifferent aspects of their environments, and may collect data over timebased on those sensed observations. For example, the ESPE may beimplemented within one or more of machines 220 and 240 shown in FIG. 2.The ESPE may be implemented within such a machine by an ESP application.An ESP application may embed an ESPE with its own dedicated thread poolor pools into its application space where the main application threadcan do application-specific work and the ESPE processes event streams atleast by creating an instance of a model into processing objects.

The engine container is the top-level container in a model that managesthe resources of the one or more projects 802. In an illustrativeembodiment, for example, there may be only one ESPE 800 for eachinstance of the ESP application, and ESPE 800 may have a unique enginename. Additionally, the one or more projects 802 may each have uniqueproject names, and each query may have a unique continuous query nameand begin with a uniquely named source window of the one or more sourcewindows 806. ESPE 800 may or may not be persistent.

Continuous query modeling involves defining directed graphs of windowsfor event stream manipulation and transformation. A window in thecontext of event stream manipulation and transformation is a processingnode in an event stream processing model. A window in a continuous querycan perform aggregations, computations, pattern-matching, and otheroperations on data flowing through the window. A continuous query may bedescribed as a directed graph of source, relational, pattern matching,and procedural windows. The one or more source windows 806 and the oneor more derived windows 808 represent continuously executing queriesthat generate updates to a query result set as new event blocks streamthrough ESPE 800. A directed graph, for example, is a set of nodesconnected by edges, where the edges have a direction associated withthem.

An event object may be described as a packet of data accessible as acollection of fields, with at least one of the fields defined as a keyor unique identifier (ID). The event object may be created using avariety of formats including binary, alphanumeric, XML, etc. Each eventobject may include one or more fields designated as a primary identifier(ID) for the event so ESPE 800 can support operation codes (opcodes) forevents including insert, update, upsert, and delete. Upsert opcodesupdate the event if the key field already exists; otherwise, the eventis inserted. For illustration, an event object may be a packed binaryrepresentation of a set of field values and include both metadata andfield data associated with an event. The metadata may include an opcodeindicating if the event represents an insert, update, delete, or upsert,a set of flags indicating if the event is a normal, partial-update, or aretention generated event from retention policy management, and a set ofmicrosecond timestamps that can be used for latency measurements.

An event block object may be described as a grouping or package of eventobjects. An event stream may be described as a flow of event blockobjects. A continuous query of the one or more continuous queries 804transforms a source event stream made up of streaming event blockobjects published into ESPE 800 into one or more output event streamsusing the one or more source windows 806 and the one or more derivedwindows 808. A continuous query can also be thought of as data flowmodeling.

The one or more source windows 806 are at the top of the directed graphand have no windows feeding into them. Event streams are published intothe one or more source windows 806, and from there, the event streamsmay be directed to the next set of connected windows as defined by thedirected graph. The one or more derived windows 808 are all instantiatedwindows that are not source windows and that have other windowsstreaming events into them. The one or more derived windows 808 mayperform computations or transformations on the incoming event streams.The one or more derived windows 808 transform event streams based on thewindow type (that is operators such as join, filter, compute, aggregate,copy, pattern match, procedural, union, etc.) and window settings. Asevent streams are published into ESPE 800, they are continuouslyqueried, and the resulting sets of derived windows in these queries arecontinuously updated.

FIG. 9 illustrates a flow chart showing an example process includingoperations performed by an event stream processing engine, according tosome embodiments of the present technology. As noted, the ESPE 800 (oran associated ESP application) defines how input event streams aretransformed into meaningful output event streams. More specifically, theESP application may define how input event streams from publishers(e.g., network devices providing sensed data) are transformed intomeaningful output event streams consumed by subscribers (e.g., a dataanalytics project being executed by a machine or set of machines).

Within the application, a user may interact with one or more userinterface windows presented to the user in a display under control ofthe ESPE independently or through a browser application in an orderselectable by the user. For example, a user may execute an ESPapplication, which causes presentation of a first user interface window,which may include a plurality of menus and selectors such as drop downmenus, buttons, text boxes, hyperlinks, etc. associated with the ESPapplication as understood by a person of skill in the art. As furtherunderstood by a person of skill in the art, various operations may beperformed in parallel, for example, using a plurality of threads.

At operation 900, an ESP application may define and start an ESPE,thereby instantiating an ESPE at a device, such as machine 220 and/or240. In an operation 902, the engine container is created. Forillustration, ESPE 800 may be instantiated using a function call thatspecifies the engine container as a manager for the model.

In an operation 904, the one or more continuous queries 804 areinstantiated by ESPE 800 as a model. The one or more continuous queries804 may be instantiated with a dedicated thread pool or pools thatgenerate updates as new events stream through ESPE 800. Forillustration, the one or more continuous queries 804 may be created tomodel business processing logic within ESPE 800, to predict eventswithin ESPE 800, to model a physical system within ESPE 800, to predictthe physical system state within ESPE 800, etc. For example, as noted,ESPE 800 may be used to support sensor data monitoring and management(e.g., sensing may include force, torque, load, strain, position,temperature, air pressure, fluid flow, chemical properties, resistance,electromagnetic fields, radiation, irradiance, proximity, acoustics,moisture, distance, speed, vibrations, acceleration, electricalpotential, or electrical current, etc.).

ESPE 800 may analyze and process events in motion or “event streams.”Instead of storing data and running queries against the stored data,ESPE 800 may store queries and stream data through them to allowcontinuous analysis of data as it is received. The one or more sourcewindows 806 and the one or more derived windows 808 may be created basedon the relational, pattern matching, and procedural algorithms thattransform the input event streams into the output event streams tomodel, simulate, score, test, predict, etc. based on the continuousquery model defined and application to the streamed data.

In an operation 906, a publish/subscribe (pub/sub) capability isinitialized for ESPE 800. In an illustrative embodiment, a pub/subcapability is initialized for each project of the one or more projects802. To initialize and enable pub/sub capability for ESPE 800, a portnumber may be provided. Pub/sub clients can use a host name of an ESPdevice running the ESPE and the port number to establish pub/subconnections to ESPE 800.

FIG. 10 illustrates an ESP system 1000 interfacing between publishingdevice 1022 and event subscribing devices 1024 a-c, according toembodiments of the present technology. ESP system 1000 may include ESPdevice or subsystem 1001, event publishing device 1022, an eventsubscribing device A 1024 a, an event subscribing device B 1024 b, andan event subscribing device C 1024 c. Input event streams are output toESP device 1001 by publishing device 1022. In alternative embodiments,the input event streams may be created by a plurality of publishingdevices. The plurality of publishing devices further may publish eventstreams to other ESP devices. The one or more continuous queriesinstantiated by ESPE 800 may analyze and process the input event streamsto form output event streams output to event subscribing device A 1024a, event subscribing device B 1024 b, and event subscribing device C1024 c. ESP system 1000 may include a greater or a fewer number of eventsubscribing devices of event subscribing devices.

Publish-subscribe is a message-oriented interaction paradigm based onindirect addressing. Processed data recipients specify their interest inreceiving information from ESPE 800 by subscribing to specific classesof events, while information sources publish events to ESPE 800 withoutdirectly addressing the receiving parties. ESPE 800 coordinates theinteractions and processes the data. In some cases, the data sourcereceives confirmation that the published information has been receivedby a data recipient.

A publish/subscribe API may be described as a library that enables anevent publisher, such as publishing device 1022, to publish eventstreams into ESPE 800 or an event subscriber, such as event subscribingdevice A 1024 a, event subscribing device B 1024 b, and eventsubscribing device C 1024 c, to subscribe to event streams from ESPE800. For illustration, one or more publish/subscribe APIs may bedefined. Using the publish/subscribe API, an event publishingapplication may publish event streams into a running event streamprocessor project source window of ESPE 800, and the event subscriptionapplication may subscribe to an event stream processor project sourcewindow of ESPE 800.

The publish/subscribe API provides cross-platform connectivity andendianness compatibility between ESP application and other networkedapplications, such as event publishing applications instantiated atpublishing device 1022, and event subscription applications instantiatedat one or more of event subscribing device A 1024 a, event subscribingdevice B 1024 b, and event subscribing device C 1024 c.

Referring back to FIG. 9, operation 906 initializes thepublish/subscribe capability of ESPE 800. In an operation 908, the oneor more projects 802 are started. The one or more started projects mayrun in the background on an ESP device. In an operation 910, an eventblock object is received from one or more computing device of the eventpublishing device 1022.

ESP subsystem 800 may include a publishing client 1002, ESPE 800, asubscribing client A 1004, a subscribing client B 1006, and asubscribing client C 1008. Publishing client 1002 may be started by anevent publishing application executing at publishing device 1022 usingthe publish/subscribe API. Subscribing client A 1004 may be started byan event subscription application A, executing at event subscribingdevice A 1024 a using the publish/subscribe API. Subscribing client B1006 may be started by an event subscription application B executing atevent subscribing device B 1024 b using the publish/subscribe API.Subscribing client C 1008 may be started by an event subscriptionapplication C executing at event subscribing device C 1024 c using thepublish/subscribe API.

An event block object containing one or more event objects is injectedinto a source window of the one or more source windows 806 from aninstance of an event publishing application on event publishing device1022. The event block object may be generated, for example, by the eventpublishing application and may be received by publishing client 1002. Aunique ID may be maintained as the event block object is passed betweenthe one or more source windows 806 and/or the one or more derivedwindows 808 of ESPE 800, and to subscribing client A 1004, subscribingclient B 806, and subscribing client C 808 and to event subscriptiondevice A 1024 a, event subscription device B 1024 b, and eventsubscription device C 1024 c. Publishing client 1002 may furthergenerate and include a unique embedded transaction ID in the event blockobject as the event block object is processed by a continuous query, aswell as the unique ID that publishing device 1022 assigned to the eventblock object.

In an operation 912, the event block object is processed through the oneor more continuous queries 804. In an operation 914, the processed eventblock object is output to one or more computing devices of the eventsubscribing devices 1024 a-c. For example, subscribing client A 804,subscribing client B 806, and subscribing client C 808 may send thereceived event block object to event subscription device A 1024 a, eventsubscription device B 1024 b, and event subscription device C 1024 c,respectively.

ESPE 800 maintains the event block containership aspect of the receivedevent blocks from when the event block is published into a source windowand works its way through the directed graph defined by the one or morecontinuous queries 804 with the various event translations before beingoutput to subscribers. Subscribers can correlate a group of subscribedevents back to a group of published events by comparing the unique ID ofthe event block object that a publisher, such as publishing device 1022,attached to the event block object with the event block ID received bythe subscriber.

In an operation 916, a determination is made concerning whether or notprocessing is stopped. If processing is not stopped, processingcontinues in operation 910 to continue receiving the one or more eventstreams containing event block objects from the, for example, one ormore network devices. If processing is stopped, processing continues inan operation 918. In operation 918, the started projects are stopped. Inoperation 920, the ESPE is shutdown.

As noted, in some embodiments, big data is processed for an analyticsproject after the data is received and stored. In other embodiments,distributed applications process continuously flowing data in real-timefrom distributed sources by applying queries to the data beforedistributing the data to geographically distributed recipients. Asnoted, an event stream processing engine (ESPE) may continuously applythe queries to the data as it is received and determines which entitiesreceive the processed data. This allows for large amounts of data beingreceived and/or collected in a variety of environments to be processedand distributed in real time. For example, as shown with respect to FIG.2, data may be collected from network devices that may include deviceswithin the internet of things, such as devices within a home automationnetwork. However, such data may be collected from a variety of differentresources in a variety of different environments. In any such situation,embodiments of the present technology allow for real-time processing ofsuch data.

Aspects of the current disclosure provide technical solutions totechnical problems, such as computing problems that arise when an ESPdevice fails which results in a complete service interruption andpotentially significant data loss. The data loss can be catastrophicwhen the streamed data is supporting mission critical operations such asthose in support of an ongoing manufacturing or drilling operation. Anembodiment of an ESP system achieves a rapid and seamless failover ofESPE running at the plurality of ESP devices without serviceinterruption or data loss, thus significantly improving the reliabilityof an operational system that relies on the live or real-time processingof the data streams. The event publishing systems, the event subscribingsystems, and each ESPE not executing at a failed ESP device are notaware of or effected by the failed ESP device. The ESP system mayinclude thousands of event publishing systems and event subscribingsystems. The ESP system keeps the failover logic and awareness withinthe boundaries of out-messaging network connector and out-messagingnetwork device.

In one example embodiment, a system is provided to support a failoverwhen event stream processing (ESP) event blocks. The system includes,but is not limited to, an out-messaging network device and a computingdevice. The computing device includes, but is not limited to, aprocessor and a computer-readable medium operably coupled to theprocessor. The processor is configured to execute an ESP engine (ESPE).The computer-readable medium has instructions stored thereon that, whenexecuted by the processor, cause the computing device to support thefailover. An event block object is received from the ESPE that includesa unique identifier. A first status of the computing device as active orstandby is determined. When the first status is active, a second statusof the computing device as newly active or not newly active isdetermined. Newly active is determined when the computing device isswitched from a standby status to an active status. When the secondstatus is newly active, a last published event block object identifierthat uniquely identifies a last published event block object isdetermined. A next event block object is selected from a non-transitorycomputer-readable medium accessible by the computing device. The nextevent block object has an event block object identifier that is greaterthan the determined last published event block object identifier. Theselected next event block object is published to an out-messagingnetwork device. When the second status of the computing device is notnewly active, the received event block object is published to theout-messaging network device. When the first status of the computingdevice is standby, the received event block object is stored in thenon-transitory computer-readable medium.

FIG. 11 is a flow chart of an example of a process for generating andusing a machine-learning model according to some aspects. Machinelearning is a branch of artificial intelligence that relates tomathematical models that can learn from, categorize, and makepredictions about data. Such mathematical models, which can be referredto as machine-learning models, can classify input data among two or moreclasses; cluster input data among two or more groups; predict a resultbased on input data; identify patterns or trends in input data; identifya distribution of input data in a space; or any combination of these.Examples of machine-learning models can include (i) neural networks;(ii) decision trees, such as classification trees and regression trees;(iii) classifiers, such as Naïve bias classifiers, logistic regressionclassifiers, ridge regression classifiers, random forest classifiers,least absolute shrinkage and selector (LASSO) classifiers, and supportvector machines; (iv) clusterers, such as k-means clusterers, mean-shiftclusterers, and spectral clusterers; (v) factorizers, such asfactorization machines, principal component analyzers and kernelprincipal component analyzers; and (vi) ensembles or other combinationsof machine-learning models. In some examples, neural networks caninclude deep neural networks, feed-forward neural networks, recurrentneural networks, convolutional neural networks, radial basis function(RBF) neural networks, echo state neural networks, long short-termmemory neural networks, bi-directional recurrent neural networks, gatedneural networks, hierarchical recurrent neural networks, stochasticneural networks, modular neural networks, spiking neural networks,dynamic neural networks, cascading neural networks, neuro-fuzzy neuralnetworks, or any combination of these.

Different machine-learning models may be used interchangeably to performa task. Examples of tasks that can be performed at least partially usingmachine-learning models include various types of scoring;bioinformatics; cheminformatics; software engineering; fraud detection;customer segmentation; generating online recommendations; adaptivewebsites; determining customer lifetime value; search engines; placingadvertisements in real time or near real time; classifying DNAsequences; affective computing; performing natural language processingand understanding; object recognition and computer vision; roboticlocomotion; playing games; optimization and metaheuristics; detectingnetwork intrusions; medical diagnosis and monitoring; or predicting whenan asset, such as a machine, will need maintenance.

Any number and combination of tools can be used to createmachine-learning models. Examples of tools for creating and managingmachine-learning models can include SAS® Enterprise Miner, SAS® RapidPredictive Modeler, and SAS® Model Manager, SAS Cloud Analytic Services(CAS) 6, SAS Viya 6 of all which are by SAS Institute Inc. of Cary, N.C.

Machine-learning models can be constructed through an at least partiallyautomated (e.g., with little or no human involvement) process calledtraining. During training, input data can be iteratively supplied to amachine-learning model to enable the machine-learning model to identifypatterns related to the input data or to identify relationships betweenthe input data and output data. With training, the machine-learningmodel can be transformed from an untrained state to a trained state.Input data can be split into one or more training sets and one or morevalidation sets, and the training process may be repeated multipletimes. The splitting may follow a k-fold cross-validation rule, aleave-one-out-rule, a leave-p-out rule, or a holdout rule. An overviewof training and using a machine-learning model is described below withrespect to the flow chart of FIG. 11.

In block 1104, training data is received. In some examples, the trainingdata is received from a remote database or a local database, constructedfrom various subsets of data, or input by a user. The training data canbe used in its raw form for training a machine-learning model orpre-processed into another form, which can then be used for training themachine-learning model. For example, the raw form of the training datacan be smoothed, truncated, aggregated, clustered, or otherwisemanipulated into another form, which can then be used for training themachine-learning model.

In block 1106, a machine-learning model is trained using the trainingdata. The machine-learning model can be trained in a supervised,unsupervised, or semi-supervised manner. In supervised training, eachinput in the training data is correlated to a desired output. Thisdesired output may be a scalar, a vector, or a different type of datastructure such as text or an image. This may enable the machine-learningmodel to learn a mapping between the inputs and desired outputs. Inunsupervised training, the training data includes inputs, but notdesired outputs, so that the machine-learning model has to findstructure in the inputs on its own. In semi-supervised training, onlysome of the inputs in the training data are correlated to desiredoutputs.

In block 1108, the machine-learning model is evaluated. For example, anevaluation dataset can be obtained, for example, via user input or froma database. The evaluation dataset can include inputs correlated todesired outputs. The inputs can be provided to the machine-learningmodel and the outputs from the machine-learning model can be compared tothe desired outputs. If the outputs from the machine-learning modelclosely correspond with the desired outputs, the machine-learning modelmay have a high degree of accuracy. For example, if 90% or more of theoutputs from the machine-learning model are the same as the desiredoutputs in the evaluation dataset, the machine-learning model may have ahigh degree of accuracy. Otherwise, the machine-learning model may havea low degree of accuracy. The 90% number is an example only. A realisticand desirable accuracy percentage is dependent on the problem and thedata.

In some examples, if the machine-learning model has an inadequate degreeof accuracy for a particular task, the process can return to block 1106,where the machine-learning model can be further trained using additionaltraining data or otherwise modified to improve accuracy. If themachine-learning model has an adequate degree of accuracy for theparticular task, the process can continue to block 1110.

In block 1110, new data is received. In some examples, the new data isreceived from a remote database or a local database, constructed fromvarious subsets of data, or input by a user. The new data may be unknownto the machine-learning model. For example, the machine-learning modelmay not have previously processed or analyzed the new data.

In block 1112, the trained machine-learning model is used to analyze thenew data and provide a result. For example, the new data can be providedas input to the trained machine-learning model. The trainedmachine-learning model can analyze the new data and provide a resultthat includes a classification of the new data into a particular class,a clustering of the new data into a particular group, a prediction basedon the new data, or any combination of these.

In block 1114, the result is post-processed. For example, the result canbe added to, multiplied with, or otherwise combined with other data aspart of a job. As another example, the result can be transformed from afirst format, such as a time series format, into another format, such asa count series format. Any number and combination of operations can beperformed on the result during post-processing.

A more specific example of a machine-learning model is the neuralnetwork 1200 shown in FIG. 12. The neural network 1200 is represented asmultiple layers of interconnected neurons, such as neuron 1208, that canexchange data between one another. The layers include an input layer1202 for receiving input data, a hidden layer 1204, and an output layer1206 for providing a result. The hidden layer 1204 is referred to ashidden because it may not be directly observable or have its inputdirectly accessible during the normal functioning of the neural network1200. Although the neural network 1200 is shown as having a specificnumber of layers and neurons for exemplary purposes, the neural network1200 can have any number and combination of layers, and each layer canhave any number and combination of neurons.

The neurons and connections between the neurons can have numericweights, which can be tuned during training. For example, training datacan be provided to the input layer 1202 of the neural network 1200, andthe neural network 1200 can use the training data to tune one or morenumeric weights of the neural network 1200. In some examples, the neuralnetwork 1200 can be trained using backpropagation. Backpropagation caninclude determining a gradient of a particular numeric weight based on adifference between an actual output of the neural network 1200 and adesired output of the neural network 1200. Based on the gradient, one ormore numeric weights of the neural network 1200 can be updated to reducethe difference, thereby increasing the accuracy of the neural network1200. This process can be repeated multiple times to train the neuralnetwork 1200. For example, this process can be repeated hundreds orthousands of times to train the neural network 1200.

In some examples, the neural network 1200 is a feed-forward neuralnetwork. In a feed-forward neural network, every neuron only propagatesan output value to a subsequent layer of the neural network 1200. Forexample, data may only move one direction (forward) from one neuron tothe next neuron in a feed-forward neural network.

In other examples, the neural network 1200 is a recurrent neuralnetwork. A recurrent neural network can include one or more feedbackloops, allowing data to propagate in both forward and backward throughthe neural network 1200. This can allow for information to persistwithin the recurrent neural network. For example, a recurrent neuralnetwork can determine an output based at least partially on informationthat the recurrent neural network has seen before, giving the recurrentneural network the ability to use previous input to inform the output.

In some examples, the neural network 1200 operates by receiving a vectorof numbers from one layer; transforming the vector of numbers into a newvector of numbers using a matrix of numeric weights, a nonlinearity, orboth; and providing the new vector of numbers to a subsequent layer ofthe neural network 1200. Each subsequent layer of the neural network1200 can repeat this process until the neural network 1200 outputs afinal result at the output layer 1206. For example, the neural network1200 can receive a vector of numbers as an input at the input layer1202. The neural network 1200 can multiply the vector of numbers by amatrix of numeric weights to determine a weighted vector. The matrix ofnumeric weights can be tuned during the training of the neural network1200. The neural network 1200 can transform the weighted vector using anonlinearity, such as a sigmoid tangent or the hyperbolic tangent. Insome examples, the nonlinearity can include a rectified linear unit,which can be expressed using the following equation:

y=max(x,0)

where y is the output and x is an input value from the weighted vector.The transformed output can be supplied to a subsequent layer, such asthe hidden layer 1204, of the neural network 1200. The subsequent layerof the neural network 1200 can receive the transformed output, multiplythe transformed output by a matrix of numeric weights and anonlinearity, and provide the result to yet another layer of the neuralnetwork 1200. This process continues until the neural network 1200outputs a final result at the output layer 1206.

Other examples of the present disclosure may include any number andcombination of machine-learning models having any number and combinationof characteristics. The machine-learning model(s) can be trained in asupervised, semi-supervised, or unsupervised manner, or any combinationof these. The machine-learning model(s) can be implemented using asingle computing device or multiple computing devices, such as thecommunications grid computing system 400 discussed above.

Implementing some examples of the present disclosure at least in part byusing machine-learning models can reduce the total number of processingiterations, time, memory, electrical power, or any combination of theseconsumed by a computing device when analyzing data. For example, aneural network may more readily identify patterns in data than otherapproaches. This may enable the neural network to analyze the data usingfewer processing cycles and less memory than other approaches, whileobtaining a similar or greater level of accuracy.

Some machine-learning approaches may be more efficiently and speedilyexecuted and processed with machine-learning specific processors (e.g.,not a generic CPU). Such processors may also provide an energy savingswhen compared to generic CPUs. For example, some of these processors caninclude a graphical processing unit (GPU), an application-specificintegrated circuit (ASIC), a field-programmable gate array (FPGA), anartificial intelligence (AI) accelerator, a neural computing core, aneural computing engine, a neural processing unit, a purpose-built chiparchitecture for deep learning, and/or some other machine-learningspecific processor that implements a machine learning approach or one ormore neural networks using semiconductor (e.g., silicon (Si), galliumarsenide (GaAs)) devices. Furthermore, these processors may also beemployed in heterogeneous computing architectures with a number of and avariety of different types of cores, engines, nodes, and/or layers toachieve various energy efficiencies, processing speed improvements, datacommunication speed improvements, and/or data efficiency targets andimprovements throughout various parts of the system when compared to ahomogeneous computing architecture that employs CPUs for general purposecomputing.

FIG. 13 illustrates a block diagram of a computing system 1300 forgenerating one or more association indications 1360. The computingsystem 1300 comprises one or more nodes for generating associationindications 1360. Association indications in the context of a sentencemay be helpful for identifying patterns and nuance in the words of thesentence. For instance, the association indications can be used tounderstand the meaning of a sentence or a part of a sentence. As oneexample, the word “bank” may have a different meaning depending on wordsassociated with it. If the word “bank” is associated with the word“river” in the sentence “They met along the bank of a river,” it has adifferent meaning than when “bank” is associated with the word “deposit”in the sentence “They made a deposit in a bank”. Association indicationscan also be useful for categorizing text information (e.g., into a goodreview or a bad review). In one example, if “liked” is associated with“not” it may be a bad review (e.g., “He liked the show not at all”).However, if it is not associated with “not” or its associated withanother word like “very” it may be a good review (e.g. “He liked theshow very much”). Association indications can also be used to gaugesentiment or an emotion of a user (e.g., “shut” associated with “up”could mean the user is angry in (“shut the heck up”) and “shut”associated with “please” could mean the user is tranquil in “shut thedoor please”).

The computing system 1300 may comprise one or more association nodes1306 for generating a dataset 1380 indicating an association betweenpairs terms (e.g., words) within a set of terms (e.g., a sentence). Forexample, an association between a pair of terms “river” and “bank”. Thedataset may comprise association measures 1364 indicating theassociation by providing a measure or score of the association. The oneor more association node 1306 may output an association indication 1360of the dataset 1380 by outputting the association measures 1364.

In one or more embodiments, the one or more association nodes 1306generate the dataset 1380 by receiving a collection 1350 comprisingmultiple sets of ordered terms (e.g., an electronic document comprisingmultiple sentences). For instance, the multiple sets comprise a firstset 1358 of ordered terms 1352 (e.g., words). Other terms 1354 of thecollection may be a part of one or more other sets (e.g., a second setor sentence). The one or more association nodes 1306 indicate anassociation between each pair of terms within a same set of thecollection (e.g., association measures 1364). In one or moreembodiments, the one or more association nodes 1306 receive parametersor settings 1370 (e.g., parameters or settings related to generating theassociation indication 1360).

In one or more embodiments, the computing system 1300 comprises one ormore input nodes 1302 and/or parsing nodes 1304 for providing acollection 1350 received by the one or more association nodes 1306. Forinstance, the input nodes 1302 could include one or more input devicesfor receiving input data 1310 from a user of the computing system 1300.Input devices could include, for example, one or more of a keyboard, amouse, a trackpad, a sensor, a receiver, and a microphone.Alternatively, or additionally, the input nodes 1302 could receive inputdata 1310 from one or more computing systems not shown. In one or moreexamples, the input data 1310 comprises text information 1312. The textinformation 1312 could comprise information representing human speech orwritings. In one or more embodiments, the text information 1312 isassociated with one or more text features 1314 (e.g., time information).For example, the input data 1310 could comprise documentary informationabout the location of people, vehicles, or robots at specific times ofthe day or state information of a complex computing system as ittransitions through time. Alternatively, or additionally the input datacomprises other types of computer-generated data with one or moreassociated features (e.g., transactional purchase data and web clickdata that records a user's path as she traverses a website).

In one or more embodiments, the input data is parsed by one or moreparsing nodes 1304 to generate the collection 1350. For example, theparsing nodes 1304 may receive possible terms 1320, and the parsingnodes 1304 will parse the input data 1310 for those possible terms. Thepossible terms 1320 may include predefined terms or generated terms. Inone or more embodiments, possible terms 1320 include one or more virtualterms 1324 where a virtual term is a single term that specifies at leasttwo terms that co-occur a variable distance apart. For example, “river”and “bank” could appear as “river bank” or “bank of a river” but is asingle linked concept. As another example, “German” and “cake” mayappear as “German cake”, “German Chocolate Cake”, or “German PecanChocolate Cake”. “German” and “cake” can be associated together to forma virtual term.

In one or more embodiments, the parsing nodes 1304 can also be used todetermine sets within the collection 1350 (e.g., first set 1358). Forinstance, the collection 1350 may represent text information comprisingtokens or combinations of tokens, where a token is one or morecharacters of text data. The parsing nodes 1304 could determine clauseor sentence boundaries separating sets of tokens.

In the same or different example, the one or more parsing nodes 1304 canbe used to determine one or more sets based on locating a symbol in acollection of data (e.g., a period to denote a different sentence, acomma to denote a different clause, a semicolon to denote a differentcomputer instruction, etc.). In the same or different embodiment, wherethe collection represents text information or computer-generated dataassociated with time information, the parsing nodes 1304 can determineone or more sets of the collection 1350 based on a time period indicatedby the time information.

Merely for illustration one or more nodes described herein may comprisesoftware or communicate with nodes comprising software implemented usingor integrated with one or more SAS software tools such as JMP®, BaseSAS, SAS® Enterprise Miner™, SAS/STAT®, SAS® High Performance AnalyticsServer, SAS® Visual Data Mining and Machine Learning, SAS® LASR™ SAS®In-Database Products, SAS® Scalable Performance Data Engine, SAS® CloudAnalytic Services, SAS/OR®, SAS/ETS®, SAS® Inventory Optimization, SAS®Inventory Optimization Workbench, SAS® Visual Analytics, SAS® Viya™, SASIn-Memory Statistics for Hadoop®, SAS® Forecast Server, SAS® ContextualAnalysis, and SAS/IML® all of which are developed and provided by SASInstitute Inc. of Cary, N.C., USA.

The computing system 1300 may also comprise one or more output nodes1308 for receiving, from the one or more association nodes 1306, anoutput association indication 1360 of a dataset 1380. For instance,output nodes 1308 could comprise a printer, a display, or storagedevice.

In one or more embodiments, the one or more association nodes 1306output the association indication 1360 of a dataset 1380 indicating anassociation between terms within a set of a collection by outputtingassociation measures 1364 indicating an association between terms.Alternatively, or additionally, the association indication 1360 compriseoutput information 1366 (e.g., a category, sentiment or meaning for theinput data 1310, text information 1312 or a term in the input data1310). The output information may be based on one or more associationmeasures 1364 for a set of the collection 1350 (e.g., first set 1358).For instance, the output information 1366 could comprise a category forthe input data 1310 (e.g., a “good review” or a “bad review”); asentiment (“e.g.” the user is “angry” or “happy”), or a meaning (“e.g.,“bank” pertains to a stream or does not pertain to a financialinstitution). The output category, sentiment or meaning may be one ofpredefined possible options according to a predefined model outcome(e.g., a model for classifying the input data 1310).

In one or more embodiments, the computing system 1300 is a computingsystem comprising multiple devices for performing different functions.Alternatively, the computing system is a single computing device and thefunctions of the multiple nodes are performed on a single computingdevice.

In cases where the singular or plural form of a node is used inembodiments described herein, one of ordinary skill in the art willunderstand that multiple or a single node could be used, respectively,instead. For instance, in one or more embodiments, the computing system1300 comprises multiple nodes for performing the same function (e.g.,distributing data across the nodes for parallel processing). The parsingnodes 1304 or the association nodes 1306 may be used to distribute thecollection 1350 across multiple computing nodes in a computing networkto generate data of identified terms within the collection 1350. In oneor more embodiments, the association nodes 1306 or parsing nodes 1304receive the generated data of identified terms. In one or moreembodiments, the association nodes 1306 generate the dataset 1360 bydistributing the generated data of terms across the same or differentmultiple ones of the computing nodes in the computing network such thatan individual node of the multiple computing nodes receives all or somedata associated with a particular term of generated data of identifiedterms.

FIGS. 14A and 14B illustrate flow diagrams for generating associationindications (e.g., association indication 1360). The methods depicted inFIGS. 14A and 14B may be implemented by a computing system (e.g.,computing system 1300).

FIG. 14A shows a method 1400 for outputting an indication of a generateddataset. In an operation 1401, the computing system receives acollection comprising multiple sets of ordered terms (e.g., a paragraphmay contain multiple different sentence containing ordered tokens withinthe sentence). The multiple sets of ordered terms comprise a first set(e.g., a first sentence).

In an operation 1402, the computing system generates a datasetindicating an association between each pair of terms within a same setof the collection.

In an operation 1403, the computing system outputs an indication of thedataset (e.g., outputs an association indication 1360).

In one or more embodiments, an operation is carried out by a series ofsequential and/or concurrent operation. For instance, FIG. 14B shows anexample method 1450 for generating a data set indicating an associationbetween each pair of terms within a same set of the collection (i.e.,operation 1402).

In an operation 1451, the computing system generates one or moreco-occurrence scores for the first set. A given co-occurrence scoreindicates a frequency of co-occurrence of a given pair of terms within aset, for example, how often a pair of terms (e.g., the words “cat” and“that”) occur together in a sentence. The scores could also between avirtual term and another term or another virtual term. In this way morethan two terms of a sentence may be considered if the virtual termcontains two or more terms. In one or more embodiments, the computingsystem generates the one or more co-occurrence scores for a given setbased on an offset table and/or a terms table.

For example, FIG. 15A shows an example text information 1500 comprisingtwo sentence sets: The cat really liked that cat a lot! The cat didn'tlike that cat very much.

FIG. 15B shows a dictionary 1510 comprising a set of words or other textstrings for use in a computing application. For instance, the dictionary1510 may comprise possible terms for parsing the text information 1500(e.g., by one or more parsing node 1304). The dictionary 1510 is anexample terms table. Each term is shown for each respective set in wordcolumn 1512. Replicated terms within a column for a given set areexcluded. Alternatively, the dictionary could have been expressed theterms in row form with replicated terms excluded with a row. A uniqueterm identifier is assigned to every term (e.g., a number) in termidentifier column 1514. In one or more embodiments, the computing systemuses the terms table to generate a customized dictionary table for acollection (e.g., a document collection containing two sentences).

In the example dictionary 1510, the terms are arranged in a processingorder for text information 1500, but could be arranged in other orders(e.g., alphabetically). In this example some tokens are treated the same(e.g., liked and like). In one or more embodiments, the computing systemreceives a term indication to treat term variations with equivalentstems or meanings as a same term (e.g., by receiving a dictionary 1510).The computing system then generates the one or more co-occurrence scoresfor the first set based on the term indication.

In one or more embodiments, a computing system generates the offsettable using a custom generated or preconfigured dictionary (e.g.,dictionary 1510 for a collection comprising text information 1500). FIG.15C shows an example offset table 1520 identifying a position for eachterm identified within a collection (e.g., using the dictionary 1510).In this example, the offset table 1520 includes a document number column1541 identifying a location for each word in a document. In this casethe sentences came from the same document (document 1). The offset table1520 includes a sentence number column 1542 identifying a location foreach word in a sentence of the document. For instance, words in the set1522 are identified as being from the first sentence with a numericalindicator of 1. Words in the set 1524 are identified as being from thesecond sentence with a numerical indicator of 2. The offset table 1520includes a token number column 1543 identifying a location for eachtoken within its respective sentence (i.e. by assigning a unique tokenidentifier unique within the sentence). The offset table includes a wordcolumn 1544 identifying the characters within a token string.

Additionally, or alternatively, the computing system computes aterm-by-term table for each set of the collection indicating each termwithin a respective set from the offset table. FIG. 16A shows an exampleterm-by-term table for the text information in FIG. 15A. Each set of thecollection appears as headers of a row and column of the table. As shownreplicated terms within a row or within a column for a given set areexcluded. This ensures all terms in the table are unique within the set.For example, as shown in FIG. 16A, words in the set 1610 are a subset ofwords from set 1522 of FIG. 15C excluding repeated words (e.g., “cat”only appears one time in the set 1610 but appears twice in the set1522). As shown, the terms table comprises numerical indicators of afrequency of co-occurrence of a given pair of terms within a set. Forinstance, the term “that” in set 1610 co-occurs with the word “cat” 2times in the first sentence. In other embodiments, the terms table is asparse table that may not include word pairs where the frequency is 0.

In an operation 1454, the computing system generates computedprobabilities based on the one or more co-occurrence scores for thefirst set. Each of the computed probabilities indicate a likelihood thatone term in a given pair of terms of the collection appears in a givenset of the collection given that another term in the given pair of termsof the collection occurs. For instance, if a term pair contains thewords “apple” and “skin” in a collection comprising sentences of a foodreport, there may be a 50% likelihood if the term “apple” appears in asentence of the food report that “skin” will also appear in the sentenceof the food report.

In an operation 1455, the computing system smooths the computedprobabilities by adding one or more random observations. For instance,the computing system may receive a parameter from a user of thecomputing system indicating a default level of random observations andadds the default level of random observations. For instance, the defaultlevel could be a numerical indicator of random observations. Bysmoothing the computer probabilities, one or more embodiments betteraccount for disparities in frequency caused by more common word pairsbecause the words of the pair are more common versus rare word pairsbecause the words of the pair are rare.

In an operation 1456, the computing system generates one or moreassociation indications for the first set based on the smoothed computedprobabilities. For instance, a respective association indicates anassociation between a respective pair of terms within a set. Thecomputing system may generate an association measure which is a modifiednormalized pointwise mutual information score based on the smoothedcomputed probabilities. The association measure can be used to generatethe one or more association indications, or the association indicationsmay indicate an association measure.

In one or more embodiments involving methods described herein,additional, fewer, or different operations can be performed depending onthe embodiment. For instance, the method 1400 could optionally includean operation 1452 for computing a first weighting. The first weightingis one of variable weights for the first set that varies based on arespective distance between a respective pair of terms within the firstset. Additionally, or alternatively, the method 1400 comprises anoperation 1453 for weighting a given co-occurrence score for the firstset by applying the first weighting to the given co-occurrence score forthe first set. One or more embodiments employing a weighting can betteraccount for sentences that may account for sets of collection withdifferent lengths (e.g., sentences).

Although some of the operational flows in methods described herein arepresented in sequence, the various operations may be performed invarious repetitions, concurrently (in parallel, for example, usingthreads and/or a distributed computing system) and/or in other ordersthan those that are illustrated. For instance, the computedprobabilities are shown as occurring after the weighting. In thissituation, the generated computed probabilities are based on the one ormore co-occurrence scores that have been weighted. In other examples,the computed probabilities could occur after the weighting.

In one or more embodiments, data pertaining to the set is distributedacross nodes in a computing network, so that each node contains a subsetof the total collection (e.g., a document domain). For example, eachnode may parse the data so that the output data contains one row perterm observed in each document in the order that the terms occurred.This output could be generated using SAS® Text Parsing provided by SASInstitute, Inc. of Cary, N.C. or other parsing software tools (e.g.,tools that tokenize, or separate, words or tools that tokenize, orseparate, sentences). FIG. 16B illustrates an example node input outputfrom a parsing node (e.g., parsing node 1304) for the term-by-term tablein FIG. 16A.

In one or more embodiments, a computing system receives one or moresettings for calculating the frequency of co-occurrence of a term i anda term j within a set (e.g., settings 1370). For instance, the settingscould comprise an instruction whether to consider a particular order ofthe term i and the term j. In FIG. 16A the example order did matter(e.g., a variable order_dependent=true). If instead the settings hadindicated that the terms could appear in any order, most of the scoreswould be double. For example, “The” in set 1610 co-occurs with cat twicewhen order does matter, but four times if counted again when thecomputing system processes each “cat” term associated with set 1610.

Additionally, or alternatively, the settings comprise an instructionindicating whether term i and term j can be the same term. For example,in FIG. 16A, there is no score for a co-occurrence between “cat” and“cat”. Additionally, or alternatively, the settings comprise a maximumvalue for a given co-occurrence score in the first set. In this case thesentence was short. However, machine data could be long with manyrepeated terms. Additionally, or alternatively, the settings comprise avariable parameter indicating a maximum distance between ordered terms.For example, as shown in FIG. 16A, if the maximum distance is set to 5,cells in term-by-term table 1600 denoted with an asterisk have a lowervalue because other matches were two far away. In one or moreembodiments, some sets of a collection may have ordered terms of alength shorter, the same length, or longer than the maximum distancebetween ordered terms.

FIG. 16B illustrates an example input to a node regarding a single term“that”. More terms could be provided to a node for processing or termscould be processed on different nodes. A distance column 1635, indicatesthe k distance between terms in column 1631 and column 1632. In thisexample, the table 1630 includes a distance column 1635 indicating thedistance between terms in number of tokens (where 1 means they areadjacent to each other). Other identifying information could beincluded. The table 1630 includes a sentence number column 1633indicating the sentence that the term pair was found. The table 1630includes a document number column 1634 containing a document identifierof the document containing that term pair. In this case order of theterm pairs did matter. If order of the term pairs did not matter, eachterm pair would appear twice: once as <term 1, term 2> pair and as asecond time as <term 2, term 1> pair. For each term in this example,there is also a special null relationship output used to represent theterm by itself.

In one or more examples, a computing system (e.g., one or moreassociation nodes 1306) receives one or more variables for weighting aco-occurrence score (e.g., a variable λ where 0≤λ≤1). FIG. 16Cillustrates example weighted co-occurrence scores. In this example, termpairs including “that” are weighted with a λ=0.5 according to theequation:

w _(ij)=1/δ^(λ),

where δ is a distance between term i and term j of the respective pairof terms (e.g., a distance in number of intervening tokens between termi and term j of the respective pair of terms).

In one or more embodiments, the computing system increases processingability of the computing system by distributing score data across nodesin the network grouped by term identifier so that a single node handlesthe same terms in a given term's column for weighting that term.Additionally, or alternatively, the output is stored sparsely (with onlynon-zero outputs stored).

In one or more embodiments, the computing system generates computedprobabilities for a set by multiplying each of co-occurrence scores(e.g., weighted co-occurrence scores) of the one or more co-occurrencescores of a set by a constant c such that an average of the one or moreco-occurrence scores for the set corresponds to a particular value(e.g., a value of 1 according to the below equations).

X′ _(ij)=Σ1/δ^(λ)

c=Σ _(i,j) X _(ij)/Σ_(i,j) X′ _(ij)

FIGS. 17A-17E illustrate example generation of association indications.In this example, weighting was not performed or λ was set to zero. Inthis case c would be equal to “1” and could either be used or alsoexcluded. The operations described with respect to FIGS. 17A-17E couldhave been performed on weighted co-occurrence scores. The associationindications for term i and term j or (A_(ij)) were computed according toequation (1):

$\begin{matrix}{A_{ij} = {\frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {\overset{\hat{}}{P}\left( {i,j} \right)} \right)} - \frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {{{\overset{\hat{}}{P}\left( {i,j} \right)}X_{ij}} = 0} \right)}}} & (1)\end{matrix}$

where:

∥D∥ is a number of sets of ordered terms in the collection;

X_(i) is a number of sets in which term i occurred in the collection;

X_(j) is a number of sets in which term j occurred in the collection;

m is a number of random observations;

${P_{i} = \frac{X_{i}}{D}};$ ${P_{j} = \frac{X_{j}}{D}};$

X_(ij) is a number of times terms i and j occur in the first set of thecollection; and

${\overset{\hat{}}{P}\left( {i,j} \right)} = {\frac{\left( {X_{ij} + {mP_{i}P_{j}}} \right)}{{D} + m}.}$

A highly correlated association indicator would be at a maximum valuefor equation (1) of 2 and a low correlated association indicator wouldbe close to a minimum value for equation (1) of 0.

FIG. 17A shows calculated probabilities P of a term i occurring and aterm j occurring for each of tokens 1-10 of the term-by-term table 1600in FIG. 16A.

In one or more embodiments, a computing system calculates a “smoothed”{circumflex over (P)}(i,j) for each pair (row, column combination) inthe matrix of term-by-term table 1600. FIG. 17B shows a table 1720 withsmoothed {circumflex over (P)}(i,j) with m=1 and ∥D∥=4 (assuming foursentences with the sentences of text information 1500 and two othersentences in the collection, which have none of the words of sentence 1and sentence 2). If m=0, no smoothing occurs, and the probabilities areall either 0.25 (occurs in one of the documents) or 0.5 (combinationoccurs in two of the documents). With m=1, all probabilities are nowdecreased: from 0.5 to 0.375 and from 0.25 to 0.198 or 0.156, dependingon the baseline probabilities.

In one or more embodiments, a computing system generates an associationmeasure which is a modified normalized pointwise mutual information(NPMI{circumflex over ( )}) score based on the smoothed computedprobabilities rather than actual probabilities. FIG. 17C shows generatedassociation measures in table 1740. These association measurescorrespond to equation (2) below.

$\begin{matrix}\frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {\overset{\hat{}}{P}\left( {i,j} \right)} \right)} & (2)\end{matrix}$

As shown in FIG. 17C the more related two numbers are, the higher thecorrelation. With m=1 (default), the correlations do not appear very bigbecause the numbers are small, so the smoothing is great in relation tothe data in this example. If a user sets m to 0.01, then the numbers areclose to the unsmoothed numbers.

The NPMI{circumflex over ( )} improves upon traditional pointwise mutualinformation that, unlike mutual information, does not weight the resultsby co-occurrence frequency. This means that rare term co-occurrence isweighted more strongly than common term co-occurrence. Further, additivesmoothing is not found in traditional applications of pointwise mutualinformation. Additive smoothing also does not traditionally use combinedconditional probabilities as in this example.

In one or more embodiments, a computing system shifts an associationmeasure by a variable pseudocount based on how common the term pair iswithin a collection of data. In one or more embodiments, the pseudocountcorresponds to equation (3) below. FIG. 17D shows calculatedpseudocounts in table 1760 of the correlations. A variable pseudocountis an improvement on techniques that may merely shift an associationmeasure by a constant value (e.g., to affect the range of the values).

$\begin{matrix}\frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {{{\overset{\hat{}}{P}\left( {i,j} \right)}X_{ij}} = 0} \right)} & (3)\end{matrix}$

In one or more embodiments, shifting is used to account for cells wherethere is no correlation (i.e. blank cells in the table 1760). In textualanalytics, blank cells could be 90% to 95% of all the cells in a matrixbecause of the amount of possible terms and virtual terms. Blank cellswill generally represent negative correlations, but how negative? Forterms that are very common, if they never occur together, they are verynegatively correlated. But if the two terms in question both occur veryrarely, even the expected number of times they occur together in a largedocument collection could be much less than one. In that case, a blankcell would be more indicative of no correlation than a negative one.Equation (3) above accounts for what a modified NPMI (NPMI{circumflexover ( )}) score would be if its frequency were 0 rather than the valueit is (i.e. Xij=0).

FIG. 17E shows association indicators in table 1780 calculated accordingto equation (1) (i.e. subtracting the values in the matrix shown intable 1760 from table 1740. In this example, the missing elements wouldall calculate to 0 if they were calculated, so doing a matrixfactorization which assumes those values as 0, like a sparse SingularValue Decomposition (SVD), works well.

In this example, the results were all positive. However, in one or moreembodiments, the factors may be weighted so that they are all positiveand/or monotonically scaled, which may be useful for factoring theresulting matrix of association indications (e.g., shown in table 1760).For instance, optionally weighting the correlations so that as the valueapproaches 1 or −1, the smoothed correlations are much more stronglyweighted than when they are closer to 0. Raising the values in table1760 to a power, p>1 guarantees the results to all be positive andmonotonically scaled. In one or more embodiments, a cutoff can be usedbased on the scaled values (considering any values>=1 to be asignificant positive term relationship).

In one or more embodiments, a computing system outputs one or moreassociation measures shown in FIGS. 17A-17E as an associationindication. Alternatively, or additionally, topic information may beoutput to indicate associations. For instance, a transformation can beused to generate a dense terms matrix (A_(k)) shown in FIG. 17F (e.g.,using Singular Value Decomposition). As shown in 17F, the term-by-termtable 1790 is decomposed and transformed to a dense terms matrix (A_(k))1798. One or more components of this decomposition can then be “rotated”into interpretable dimensions, maximizing the sums of the weights of theindividual terms projected onto each axis. For instance, U_(k) matrix1794 is a truncated dense matrix of term projections. This can bemultiplied by Σ_(k) matrix 1796 and rotated into interpretabledimensions. For instance, the new axes of these dimensions can then beconsidered as “topics”. Topic information may then be output to indicatethe associations.

FIG. 18 illustrates example generation of association indications on50,000,000 words parsed from a dataset derived from a collection ofpublicly available webpages comprising 3,472,222 sentences. The firstten word pairs in set 1810 of table 1800 are the strongest correlatedterms, of those occurring at least 1,000 times in the dataset. Thesecond ten in set 1820 are those that have the weakest correlations ofthose occurring at least 1,000 times in the dataset. Techniques hereinhelp distinguish meaningful associations as opposed to just words thatco-occurred a lot together because they are often used words in theEnglish language (e.g., articles such as “the” and “a”). The count wordcolumn 1830 shows that these weaker correlated words occurred more oftenand in some cases as shown in the co-occurrence count column 1831,co-occurred frequently. The words “it” and “the” had one of the highestco-occurrence scores in co-occurrence count column 1831. Columns in set1832 shows calculations according to equation (1) resulting inassociation indicators in term correlation value column 1833. Ten randomobservations were added according to equation (1) (i.e. m=10). In thisexample, the values were also raised to a power of 3 in raised-to-powercolumn 1834 or shown as a percentage in alternative column 1835. Any ofthese different ways to represent the association could be output as anassociation indication.

FIG. 19 illustrates a table 1900 of example generation of associationindications for generated data to show performance of techniquesdescribed herein for edge cases. For instance, word 14 and word 15represents two words that occur in every sentence but never incooccurrence relationship with each other showing a value of 0 in countof co-occurrence column 1931. In contrast, word 10 and word 12 representthe opposite case, where the two terms are in all the data and almostalways cooccur with an association score of 1.999999 out of maximum of 2for the association indications in term correlation column 1933.

Table 1900 shows improvements of described techniques over traditionalapproaches to determining association or correlation between terms.Traditional approaches used a normalized pointwise mutual informationequation between two terms. This traditional approach attempted tocreate a “correlation-like” number between −1 and 1 that measures theassociation of two words based on their frequency of cooccurrenceaccording to equation (4).

$\begin{matrix}{{{npmi}\left( {i,j} \right)} = {\frac{pm{i\left( {i,j} \right)}}{{- \log}\; \left( P_{ij} \right)} = {\frac{\log \; \left( {P_{i}P_{j}} \right)}{\log \; \left( P_{ij} \right)} - 1}}} & (4)\end{matrix}$

NPMI Column 1932 of table 1900 shows NPMI values for each of the edgecases. Word pairs word 3 and word 5 (3,5); word 1 and word 2 (1,2); andword 6 and word 7 (6,7) each had the same score (an NPMI score of 1)even though their observed frequency was different as shown in countword column 1930. Ideally, large amounts of evidence of correlationshould be weighted higher than smaller. Intuitively, these word pairsshould not have the same association score. By smoothing the estimateand adding random observations as described herein, claimed embodimentscan better reflect these different amounts. For instance, as showncalculations for modified NPMI (e.g., alt NPMI{circumflex over ( )}column 1936) distinguish between these frequencies with higherassociation scores awarded to (6,7) who had a higher frequency countthan (3,5) that had a lower frequency count in count word column 1930.Ultimately the association score in term correlation column 1933 alsoaccounts for what a modified NPMI (NPMI{circumflex over ( )}) scorewould be if the frequency is 0 as shown in NPMI{circumflex over( )}(Xij=0) column 1937. The values in association indications shown inthe term correlations column 1933 show a distinction between these wordpairs of different frequency with higher association scores awarded to(6,7) than to (1,2) and (3,5). By raising the values in the termcorrelations column 1933 to a power of 3 in the raised-to-power column1934, the distinction is increased. The distinctions can also berepresented as a percentage in percentage column 1935.

Word pairs word 1 and word 3; word 6 and word 4; and word 9 and word 6demonstrate cases where a frequent term (like an article) is combinedwith a rare term, but there is full overlap whenever the rare termoccurs. In this case, the least frequent (and lower evidence) examplesshow reversing order in terms of significance with word pair word 1 andword 3 having a lowest co-occurrence score in co-occurrence column 1931,but a higher NPMI score in NPMI column 1932. Techniques herein reversethat trend as shown in term correlation column 1933, raised-to-powercolumn 1934, and percentage column 1935.

No NMPI score is possible, when words never occur together as shown forword pair word 14 and word 15 with no value in the NPMI column 1932. Acommon way to deal with this problem is just to ignore cells thatproduce a negative association value, which is called Positive PointwiseMutual Information (PPMI). Ignoring negative correlation informationseems reasonable for rare words, but for common words, this is a lot ofinformation to throw away. By using a modified NPMI (NPMI{circumflexover ( )}) technique, embodiments herein can provide an appropriatelylow score (e.g., as shown in alt NPMI{circumflex over ( )} column 1936).For instance, percentage column 1935 shows a score of a true “0” valuefor no correlation or association.

In one or more embodiments, computed association or correlationindicators are output as an indication of a dataset of associations.Alternatively, or alternatively, other indications may be output. Forinstance, the association indicators can be used to determine or selectcandidates for virtual terms that often cooccur together. These virtualterms may be meaningful to look at or parse data for on their own (e.g.,“river” and “bank” or “German” and “cake”). In one or more embodiments,a computing system (e.g., computing system 1300) outputs terms thatexceed a certain smoothed term correlation value (e.g., that exceed thevalue 1) as candidates for virtual terms. Additionally, oralternatively, virtual terms are output that show strong correlationswith one of the topics identified in the singular value decomposition,or show strong correlations, or mutual information with some othervariable in the data. These virtual terms can then be implemented asadditional terms in and of themselves. Virtual terms are also useful foranalyzing terms, mapping terms and building rules using terms (e.g.,concept and category rules).

FIG. 20 illustrates a block diagram of a computing system 2000 forgenerating virtual terms. In one or more embodiments, the computingsystem 2000 is the same or different from computing system 1300. Forinstance, in one or more embodiments, the computing system 2000comprises one or more components, features, or computing devices ofcomputing system 1300 (e.g., one or more input nodes 1302, one or moreparsing nodes 1304, one or more association nodes 1306, and one or moreoutput nodes 1308). Alternatively, the computing system 2000 comprisesdifferent components, features or computing devices for generatingvirtual terms (e.g., one or more virtual term nodes 2002).

In the example, the computing system 2000 receives a dataset 2010 of adictionary of possible terms. In one or more embodiments, the computingsystem 2000 receives the dataset 2010 using one or more nodes of thecomputing system 2000 (e.g., input nodes 1302, parsing nodes 1304,association nodes 1306, or virtual term nodes 2002). The dataset 2010 isfor identifying one or more of the possible terms in data that comprisesordered terms. For instance, the dataset 2010 could comprise possibleterms 1320 shown in FIG. 13 (e.g., terms or virtual terms that may befound in the collection 1350. Alternatively, or additionally, thedataset 2010 could comprise the collection 1350 shown in FIG. 13identifying possible terms in data comprising ordered terms (e.g., acollection 1350 produced by one or more parsing nodes 1304).Alternatively, or additionally, the dataset 2010 comprises the possibleterms 1320 modified by the collection 1350. For example, if thecollection 1350 relates to mechanic notes, the possible terms 1320 maybe reduced by a user or a node in computing system 2000 to a subset ofpossible terms pertinent to mechanic notes. In one or more embodiments,one or more virtual term nodes 2002 receive the dataset 2010 from auser, another node in the computing system 2000, or another computingsystem.

In one or more embodiments, the computing system 2000 obtains one ormore computer-generated association measures. Each association measureis an association between a pair of terms from a plurality of identifiedterms of the possible terms 1320 that were identified in data (e.g., incollection 1350). For example, one or more association nodes 1306 maygenerate association indication 1360 indicting one or more of thecomputer-generated association measures (e.g., association measure 1362of an association between an identified first term and a second term).These association measures could be generated by embodiments describedherein. Alternatively, or additionally, the association measures can beobtained from another computing system or user. One or more virtual termnodes 2002 may receive the generated association indication 1360indicting the one or more of the computer-generated associationmeasures.

The computing system 2000 generates, based on one or more of theobtained computer-generated association measures, one or more virtualterm(s) 2050. For instance, a virtual term may comprise a single termthat specifies a first term (e.g., Term 1322A) and a second term (e.g.,Term 1322B) that co-occur a variable distance apart. In one or moreembodiments, the computing system 2000 generates multiple virtual terms2050 and the computing system selects a subset from the multiple virtualterms (e.g., virtual term 1324).

The computing system 2000 outputs an indication 2040 to include one ormore virtual terms 2050 in the dataset of possible terms (e.g., a subsetof virtual terms). For instance, the computing system 2000 may output anupdated dataset 2042 for the dataset 2010. The updated dataset 2042 mayinclude a virtual term. It may include other possible terms (e.g.,possible terms 1320). Alternatively, or additionally, the computingsystem may append the virtual term to a dataset of possible terms (e.g.,dataset 2010, or possible terms 1320).

In one or more embodiments, the computing system 2000 receivesparameters 2020 (e.g., parameters or thresholds for selecting virtualterms). For example, the computing system 2000 may receive a thresholdscore for the computer-generated association measures. The computingsystem may compare the computer-generated association measures ofcorresponding multiple generated virtual terms 2050 to a threshold andselect virtual terms that exceed the threshold.

Alternatively, or additionally, the computing system 2000 may receive aparameter indicating an amount of allowed virtual terms. This amount maybe relative to the amount of possible terms 1320 (e.g., a ratio of anumber of the possible terms 1320 to a number of allowed virtual terms).If the number of generated multiple virtual terms 2050 (or ones thatexceed a threshold) exceeds the number of allowed virtual terms, thecomputing system 2000 may select a subset of the multiple virtual termsthat is equal to or less than the number of allowed virtual terms. Thecomputing system 2000 may select the subset based on comparing thecomputer-generated association measures (e.g., ranking the measures andselecting terms for a virtual term that had the highest associationmeasures in the ranking).

Alternatively, or additionally, the computing system 2000 may use amachine learning algorithm to select a subset of the plurality ofvirtual terms. For example, the computing system 2000 may receive atarget variable for a supervised machine learning algorithm. Thecomputing system may execute the supervised machine learning algorithmto select, based on the target variable, a subset of the multiplevirtual terms 2050.

Alternatively, or additionally, the computing system 2000 may select asubset of virtual terms by determining correlations between individualvirtual terms of the multiple virtual terms and topics. For example, thetopics could relate to relevance to a context in which it would beuseful to have virtual terms (e.g., relevance to tools, in a collectionrelated to mechanic notes). The computing system 2000 may select asubset of the multiple virtual terms 2050 based on the correlations.

In one or more embodiments the computing system 2000 (e.g., one or morevirtual nodes 2002) generates one or more virtual term features 2030. Avirtual term feature 2030 could be associated with a generated virtualterm (e.g., a tag for that virtual term). For instance, a virtual termfeature 2030 could comprise a correlation with one or more possibleoptions (e.g., predefined options for a topic, category, sentiment ormeaning). If that virtual term is found in a subsequent collection, thatfeature could indicate something about the virtual term (e.g., itsmeaning within the dataset) or something about the collection or aspectof the collection (e.g., a category for the collection).

In one or more embodiments, the computing system 2000 can provide anindication 2040 to the computing system (e.g., to one or more parsingnodes 1304) for adding the virtual term to a dataset of possible terms(e.g., possible terms 1320). The computing system 2000 can then parsenew data (e.g., data comprising one or more different terms or adifferent term ordering) for an added virtual term (e.g., virtual term1324). When new data is received by the computing system, the computingsystem 2000 may identify the virtual term in the new data according tothe generated dataset; and identify one or more features about the newdata based on the one or more features for the virtual term.

In one or more embodiments, the virtual term specifies more than twoterms that co-occur in the data. For instance, the computing system 2000can generate further virtual terms based on a data set of possible terms1320 that includes an initial or previously added virtual term (e.g.virtual term 1324). The computing system 2000 obtains acomputer-generated association measure of an association between theinitial virtual term (e.g., virtual term 1324) and another term of thegenerated dataset (e.g., term 1322 or another virtual term). Based onthe obtained computer-generated association measure, the computingsystem 2000 generates an additional virtual term that specifies theinitial virtual term and another term that co-occurs in the data avariable distance apart. The association indication 1360 may indicate toinclude the additional virtual term in the dataset of possible terms.This way virtual terms can accumulate to more than just two contributingterms.

FIG. 21 illustrates a flow diagram for a method 2100 for generating avirtual term. The method 2100 could be implemented by a one or morenodes described herein (e.g., in computing system 1300 or computingsystem 2000).

The method 2100 illustrates an operation 2101 for receiving a dataset ofa dictionary of possible terms for identifying one or more of possibleterms in data comprising ordered terms. For instance, the data is textinformation (e.g., text information 1312).

The method 2100 illustrates an operation 2102 for obtainingcomputer-generated association measures. Each association measure of thecomputer-generated association measures is an association between a pairof terms. The terms are from a plurality of identified terms of thepossible terms that were identified in the data. The identified termscomprise a first term and a second term. For instance, the terms couldbe words identified within a sentence or clause of the text information.

The obtained computer-generated association measures may be generated asdescribed herein. Alternatively, or additionally, the computer-generatedassociation measures may be received from a computing system thatgenerates association measures as described herein. For instance, thecomputer-generated association measures may be based on a frequency ofco-occurrence of each pairs of the possible terms that were identifiedin the data as described herein. Additionally, or alternatively, thecomputer-generated association measures may be based on a variableweighting based on a distance between terms of a respective pair of themultiple identified terms.

The method 2100 illustrates an operation 2103 for, based on one or moreof the obtained computer-generated association measures, generating avirtual term. The virtual term comprises a single term that specifiesthe first term and the second term that co-occur a variable distanceapart.

The method 2100 illustrates an operation 2104, for outputting anindication to include the virtual term in the dataset of possible terms(e.g., virtual term indication 2040).

In one or more embodiments, the method 2100 comprises an optionaloperation 2105 to output one or more features of the virtual term (e.g.,a meaning for the virtual term or a prediction about the text thevirtual term would appear in).

FIG. 22 illustrates a graphical user interface 2200 on a display device2240. The graphical user interface 2200 may be used for the user tocontrol computer generation of association measures or virtual term. Thegraphical user interface 2200 may be used for a user to browse for dataon the computing system (e.g., computing system 1300 or 2000) forgenerating association measures or virtual terms (e.g., by using thebrowse for collection control 2220). It may also be used to inputsettings described herein (e.g., using settings control 2270). Forinstance, the settings may be used to indicate that words with similarstems should be treated the same or should be treated differently. Ifthey are treated the same a first term may indicate multiple terms ofthe same stem. Alternatively, or additionally the settings may set amaximum distance between words of a virtual term.

Alternatively, or additionally the computing system may receive from auser input or selection of terms of a virtual term. For instance, thecomputing system may receive a user identification of the first term(e.g., by inputting it in textbox 2230 in graphical user interface2200). The computing system displays, on a display device (e.g., displaydevice 2240), candidate terms for the virtual term (e.g., in a text box2250). The computing system receives, from the user of the computingsystem, a user selection of the second term (e.g., by selecting a secondterm such as “German”) and using the select control 2260. The computingsystem generates the virtual term based on the user input and selectionof virtual terms.

The virtual term may specify an ordering for the first term and thesecond term (e.g., German could be the first term or the second term).Alternatively, or additionally, the virtual term may specify a maximumdistance between the first term and the second term (e.g., “German” isfound within 3 words from “cake”). In this example, the user may usethis information to select virtual terms (e.g., eliminating “bake”because it may be too far apart from cake) or modify a setting (e.g.,change “5” to a closer number “3” or require a candidate term to be thefirst identified term or the second identified term in identifying theterms of the virtual term).

FIG. 23 illustrates a word embedding 2300 with a virtual term 2302.There has been substantial work in recent years on distributionalsemantics, which relies on the “distributional hypothesis”: loosely put,“you shall know words by the company they keep”. Distributionalsemantics generally assumes that one can map words to vectors in amulti-dimensional metric space, where the cosine of the angle betweenvectors indicates similarity of the corresponding words (if the vectorsare normalized to have constant length, then Euclidean distance can alsobe used to relate terms). This mapping of words into a multi-dimensionalspace is generally referred to as generating word embeddings. Forexample, FIG. 22 shows an example word embedding 2300 on a topic relatedto food terms where the terms are separated in a multi-dimensionalspace.

SAS Institute, Inc. of Cary, N.C. provides software for generating orworking with word-embeddings. For instance, SAS® Text Miner and SAS®Viya® is useful for generating word-embeddings and SAS® EnterpriseMiner™ is useful for modeling based on word-embeddings. Word embeddingsare useful for of SAS® Text Clustering and Text Topic capabilities.

More information is possible when there is a joint “word embedding” and“document embedding”. A computing system can rotate the dimensions ofthe space to align with strong directions and call the resulting axes“topics” providing interpretability to each of the dimensions.Alternatively, or additionally, the computing system can take thedocument embeddings, after suitably normalizing them, and feed them intoany clustering or predictive modeling algorithm as predictor variables.

Embodiments herein improve traditional SVD to factor a term-by-termoccurrence matrix (e.g., as described with respect to FIG. 17F). In oneor more embodiments, a computing system (e.g., one or more associationnodes 1306) outputs an indication of the dataset by generating topicdata or predictive modeling data based on a vector, or rotated vector,resulting from a term-by-term matrix. In one or more embodiments, thecomputing system generates the term-by term matrix for each set of acollection. The term-by-term matrix may be a sparse term-by-term matrixin that certain values are left out (e.g., zero values). The computingsystem can generate a singular value decomposition (SVD) of the (sparse)term-by-term matrix to generate the word embedding (e.g., word embedding2300).

Further, embodiments herein improve word embeddings by including virtualterms (e.g., virtual term 2302). The following is example code used forgenerating word embeddings. It was performed by SAS® Viya® on a data setairlinefeedbackcat, which contains airline feedback comments.

%let sourceloc=\\tmdev\tmine\data\; libname tm ″&sourceloc″; /* Movedocuments from SAS table to CAS table */ datasascas1.airlinefeedbackcat;  set tm.airlinefeedbackcat;  id=_n_;  run;

First a computing system executing the code parses the data (e.g., byone or more parsing nodes 1304 described herein. Depending on options,the data can optionally include multi-word phrases such as noun groupsor entities (e.g., person name and location). In addition, if tagging isused, words used as different parts of speech are treated distinctly.Neither of these capabilities are generally present in traditionalapproaches.

/* Parse documents using tmMine action */ proc cas; loadactionset′textMining′; run; action tmMine;  param   docid=″id″   documents={name=″airlinefeedbackcat″}   text=″text″   nounGroups=True  quittagging=true   entities=″none″   offset={name=″offset″,replace=True}   terms={name=″terms″, replace=True}   parseConfig={name=″config″,replace=True}   reduce=8   stemming=True  legacyNames=true; quit;

Then the computing system executing the code takes an offset table(“offset”) which contains every term in every document that is parsed,in order, and the terms table (“terms”) and feed those to the tmCooccuraction. The tmCooccur action identifies how often each term pair occursand calculates an association measure based on frequency of cooccurrencecompared to expected frequency of cooccurrence.

/* Run tmCooccur action*/ proc cas;  loadactionset ″textUtil″;  actiontmCooccur result=cooccur_res/ offset={name=″offset″,  caslib=″CASUSERHDFS″} terms={name=″terms″,   caslib=″CASUSERHDFS″}  cooccurrence={name=″cooccur″, replace=True}  cooccurrenceOffset={name=″cooccur_pos″,   replace=True}   maxDist=25  minCount=1   ordered=False   smoothing 5   xmax=100  frequencyExponent=.6   distanceExponent=.5   useParentId=True;  run;quit;

The parameters used in the example for the tmCooccur action arereasonable choices found in testing to be generally effective forgenerating embeddings.

The maxDist=25 parameter specifies that any word pairs that occur inthis case more than 25 words apart in the same sentence will not betreated as a cooccurrence. This is important when sentence boundariesmight be missing in some documents. This is also useful for modelingsyntactic relationships. This distance could be very small (e.g., 3-5words) for some applications.

The ordered=false parameter is useful for word embeddings where wordorder of the terms does not matter. An ordered=true parameters may beuseful for creating statistics for when the first term (or row term)comes earlier in the sentence than the second term (or column term).

In the Mincount=1 parameter, the value of 1 indicates every pair ofterms is considered since they cooccur at least once. If the computingsystem is processing a large collection, it may be useful to set ahigher value for the Mincount parameter.

For the useParentID=true parameter, when the value is set to true, allterm variations are equivalent to their stems and any synonyms in asynonym list are considered.

For the smoothing=5 parameter, this setting specifies the alphasmoothing parameter for additive smoothing applied to the counts of thecooccurrences of each term pair. If no smoothing is done (smoothing=0),then complete cooccurrence of two rare terms is considered equivalent tocomplete cooccurrence of two common terms in the correlationcalculation, which is unrealistic.

The distanceExponent=0.5 parameter enables a computing system to weightterm cooccurrences more strongly when the two words are close togetherin the sentence than when they are far apart. This value of 0.5indicates that terms should be down weighted based on the square root ofthe number of words between them.

The frequencyExponent=0.6 parameter indicates how much the termcorrelation is weighted by the frequency of that cooccurrence to givethe association value. Generally, the best results occur when thefrequency is raised to an exponent of about 0.6. Using a frequencyexponent greater than 0 guarantees that the most common termcooccurrences have the largest effect on the SVD factorization.

The Xmax=100 setting controls the maximum frequency that will be raisedto the frequency exponent. Any cooccurrence frequencies in excess ofthis value will be weighted as if it was that value. Words that are verycommon frequently cooccur even though their cooccurrences are not thatrelevant and this parameter can help limit that affect.

Term embeddings are created by applying the SVD to the sparseterm-by-term matrix of associations calculated by tmCooccur. In the codebelow, the tmSvd action performs the matrix factorization and projectsthe associations into a lower dimensional space of term rows (docpro)and term columns (wordpro). The tmSvd action can rotate theseprojections into topics like when a term-by-document matrix is fed in.In this example, the computing system is doing projections in 200dimensions and also rotating the results to create topics:

/* Now create word embeddings using tmSvd action for the term by termmatrix created by tmCooccur action */ proc cas;   loadactionset′textMining′;   action tmSvd;   param config=″config″   parent={name=″cooccur″,where=″_Freq2_>=20″}    termid=″_Termid1_″   docid=″_Termid2    _″    count=″_Associati    on_″terms=    ″terms″   timing=True    rowPivot=0.7    k=200    norm=″ALL″   wordpro={name=″word_a″,replace=True}   docpro={name=″docpro_a″,replace=True}   topics={name=″topic_a″,replace=True}    numLabels=7   topicDecision=False u={name=″svd_a″,replace=True}   scoreConfig={name=″scoreconfig″,replace=True}    legacyNames=True ; quit;

The where=“_Freq2_>=20” specifies only the term columns that occurfrequently by setting a threshold on the frequency. This addressesproblems in using a term-by-terms table rather than a term-by-documenttable. When the SVD is calculated on the term-by-document matrix, thewordpro table corresponds to the word projections and the docpro tablecorresponds to the document projections or the context in which thosewords occur. But when the computing system does a term-by-term matrix,they are both term projections. Based on options for tmCooccur action,the matrix is symmetric and both output matrices will be the same (inthat case, essentially it would be equivalent to a sparse principalcomponent analysis). However, the rare term combinations found in theterm-by-term matrix will dominate the projections, rendering the resultsless useful. To address both issues, the user specifies a frequency forthe term columns.

The parameters to the tmCooccur action determine how the measure ofassociation is calculated. In general, it is based on a modifiednormalized pointwise mutual (NPMI{circumflex over ( )}) informationscore; the result can be considered as a correlation between the terms.That correlation is then optionally weighted by frequency.

One or more embodiments are also useful for document-level encodings andshow improvements over traditional approaches to document-levelencodings. Word embeddings themselves are useful for understanding howwords relate to each other. For other applications it is useful tounderstand the document itself (e.g., for topic analysis, textcategorization, or sentiment analysis).

FIG. 24 illustrates tables of performance to classify documents intodifferent categories of techniques for document embeddings hereincompared to traditional embeddings. The documents came from three datasets that had natural text categories: (1) an airline feedback data setregarding airline reviews (the categorical variable was the category ofthe feedback obtained); (2) a Newsgroup data set of news articles; and(3) NHTSA vehicle complaint data set from the first quarter of 2008 (thecategorical variable was the component of the car that was beingcommented about).

The table 2400 shows aspects of the data sets. It includes a documentscolumn 2404 indicating the number of documents in each data set; acategories column 2406 indicating the number of categories, and abaseline probability column 2408 (in this case, the percentage ofdocuments in the most common category).

The table 2400 also shows performance comparisons for performancewithout virtual terms. For each data set, an autotuning neural network(autotune.tuneNeuralNet CAS action) with 10-fold cross validation wasused to get an overall accuracy number. In all cases, 200 embeddingdimensions were used. The final four columns show the accuracy obtainedin classifying using (1) term-by-document SVD produced by SAS® TextMiner in column 2410; (2) a skip gram model in skip gram column 2412;(3) a sentence term-by-term SVD performed using a tmCooccur actionaccording to embodiments described herein in column 2414; and (4) adocument term-by-term SVD in column 2416.

A skip gram model is used to measure associations in short set contexts(e.g., within a 3-5 word window). In this example, the skip-gram modelis based on a five-word context to both the left and right of a targetword.

On the Newsgroups data, a slightly better result was obtained for theterm-by-term SVD approach that used the co-occurrence of terms in asentence. For the other two data sets, the best result was for thestandard term-by-document factorization. In all three cases, the worstresult was obtained from the skip-gram.

Perhaps by having a larger context, the term-by-document matrix has moreinformation available to it. There are likely three reasons theskip-gram model did not do well. Skip-gram likely did not do well in anapplication for text documents because Skip-gram considers a shortercontext and thus has less information available to it. The short contextmeans that embeddings generated from it are a mix of syntactic andsemantic information. Syntactic information is more useful for deepparsing, machine translation and sentiment relationships. Semanticinformation is more useful for document categorization, document-levelsentiment, and role labeling. Longer contexts are more useful forsemantic information. Further, skip-gram has no notion of sentenceboundaries and went across boundaries when deciding what wordsinfluenced other words. On the other hand, embodiments herein using atmCoocur action takes sentence boundaries into consideration.

Another thing that the tmCooccur action can do is to spot stronglycooccurring terms that can provide context to each other. Consider thefollowing examples sentences:

(1) I go for a run of at least two miles every day.

(2) The play has had a very successful run.

(3) He gave the reigning chess champion quite a run for his money.

(4) If you would just shut the heck up, we can deal with this issue.

(5) Please shut the door on the way out.

(6) I didn't really like the movie very much.

(7) I really like the movie a lot!

In the first three sentences, three different senses of the noun “run”are used; in the fourth and fifth sentences, the verb particle form“shut up” versus the plain verb “shut” should be distinguished; and inthe last two sentences, the use of the “not” term, “didn't”, in onesentence and not in the other causes the sentiment to be polar opposite.

In these cases, if a computing system can identify those important wordrelationships, then the computing system can treat each of these “pairsof words” as a single term. In this example, a threshold associationscore is set, and word pairs that exceed that score are identified. Theneach such word pair forms a “virtual term”; that is, a virtual term is aword pair that has strong association and is denoted as “<term 1> . . .<term 2>” (for example, “run . . . mile” or “n′t . . . like”). Acomputing system can then treat them as ordinary terms and use them forrule building, word embeddings, topic analysis, document categorization,etc.

This approach improved even the term-by-document SVD approach withparameters set so that order mattered (so that the term “run . . . mile”would mean that the word “run” preceded the word “mile” in thesentence), and a virtual term association cutoff was identified so thatthe number of virtual terms would equal the number of actual terms. Thenterm and document embeddings were generated and text categorizationaccuracy was computed.

Table 2450 shows the improvement to term-by-document SVD whenconsidering virtual terms as described herein. The airline feedback datashowed a huge advantage when including virtual terms. Based on otherdata not shown in Table 2450, it appears including virtual terms wasuseful particularly for sentiment analysis. Even in some situations inwhich virtual terms do not appear to give any additional lift inmodeling or additional value in terms of accuracy, they did adddescriptive value by including virtual terms in topic labels or by doingautomatic rule generation and having the rules include virtual terms.

These examples were given in the context of textual information.However, embodiments herein are applicable to other data as describedherein (e.g., computer-generated information or information withassociated time information).

FIG. 25A illustrates text information with associated time information.The text information was gathered from an American Time Use Survey fromthe Bureau of Labor Statistics available at https://www.bls.gov/tus/. Inthis survey, users provided information about the various activitiesthey participate in throughout the day such as eating, householdactivities, working, and driving. Responses are tied to a given personon a given day and are ordered based on the time and duration that theyoccurred. In this data, there are over 100,000 daily records and a totalof over 500 distinct activities recorded. Table 2500 shows example datafrom a user's morning.

The individual's day of activities is analogous to a sentence contextand each activity is analogous to a word in the sentence. Embodimentsherein can aid in understanding the cooccurrence of different activitiesthat a person engages in.

FIG. 25B illustrates association indications plotted in graph 2550. Theassociation measures are plotted between activities with strongerassociations shown in dark and having a higher value. The sequentialpattern of “waiting associated with services” before “using health andcare services outside the home” was picked up immediately in theassociation calculation (with a highest value of 0.86). In one or moreembodiments, a computing system outputs plotted association measures toan output device for analysis by a use of the computing system or user.

The SVD techniques described herein can be applied to the associationsfound in the survey responses. Each activity receives a vectorrepresentation derived from the data set. With these embeddings, it ispossible to place the terms in a k-dimensional space and check forsimilarity. Table 1 below shows three activities and their nearestneighbors in that space. The similarity in this case is based on thecontext of the individual's day, and not necessarily functionallysimilar activities.

TABLE 1 Activity Nearest Activity Sleeplessness Using in-home health andcare services Interior Cleaning Laundry Email Computer user for leisure(ex. Games)

FIG. 26 illustrates a block diagram of a computing device node 2600. Inone or more embodiments, a node described herein (e.g., an input node1302, a parsing node 1304, an association node 1306, a virtual term node2002, or an output node 1308) or a combination of nodes described hereincomprises one or more components of computing device node 2600.Computing device node 2600 is configured to exchange information withother computing device nodes or components of a system (e.g., computingsystem 1300 or computing system 2000). Computing device node 2600comprises an input interface 2604 for receiving data and an outputinterface 2606 for outputting data (e.g., input data 1310, dataset 2010,possible terms 1320, collection 1350, association indication 1360,virtual term indication 2040, virtual term feature 2030, settings 1370).The input interface 2604 and output interface 2606 could comprisemultiple interfaces or could be combined into a single interface.

Computing device node 2600 comprises computer-readable medium 2602,which is an electronic holding place or storage for information so theinformation can be accessed by processor (e.g., processor 2608).Computer-readable medium 2602 can include, but is not limited to, anytype of random access memory (RAM), any type of read only memory (ROM),any type of flash memory, etc. such as magnetic storage devices (e.g.,hard disk, floppy disk, magnetic strips), optical disks (e.g., compactdisc (CD), digital versatile disc (DVD)), smart cards, flash memorydevices, etc.

Computing device node 2600 comprises a processor 2608 that executesinstructions (e.g., stored at the computer-readable medium 2602). Theinstructions can be carried out by a special purpose computer, logiccircuits, or hardware circuits. In one or more embodiments, processor2608 is implemented in hardware and/or firmware. Processor 2608 executesan instruction, meaning it performs or controls the operations calledfor by that instruction. The term “execution” is the process of runningan application or the carrying out of the operation called for by aninstruction. The instructions can be written using one or moreprogramming language, scripting language, assembly language, etc.Processor 2608 operably couples with input interface 2604, with outputinterface 2606 and with computer-readable medium 2602 to receive, tosend, and to process information. Processor 2608 in one or moreembodiments can retrieve a set of instructions from a permanent memorydevice and copy the instructions in an executable form to a temporarymemory device that is generally some form of RAM.

In one or more embodiments, computer-readable medium 2602 storesinstructions for execution by processor 2608 to cause a computing nodeor system to carry out embodiments described herein. For example,computer-readable medium 2602 could comprise instructions for dataparser application 2620 for parsing data (e.g., text information) foridentifying terms; an association application 2622 for determiningassociation measures as described herein, and a virtual term application2624 for generating virtual terms and indicating to include virtualterms as described herein. In other embodiments, fewer, different, oradditional applications can be stored in computer-readable medium 2602.

In one or more embodiments, one or more applications stored oncomputer-readable medium 2602 are implemented in software (e.g.,computer-readable and/or computer-executable instructions) stored incomputer-readable medium 2602 and accessible by processor 2608 forexecution of the instructions. The applications can be written using oneor more programming languages, assembly languages, scripting languages,etc. The one or more application can be integrated with other dataanalytics software application and/or software architecture such as thatoffered by SAS Institute Inc. of Cary, N.C., USA as described herein.

In other embodiments, fewer, different, and additional components can beincorporated into computing device node 2600.

One or more embodiments herein represent improvements over traditionalapproaches for determining association measures. For instance, one ormore embodiments use additive smoothing by combining conditionalprobabilities as input to NPMI. Embodiments also shift values by avariable value such that missing association measures are true zeros.

Further, other approaches to determining association measures are notwell suited for applications related to sentences that might be verylong and of variable length. Other approaches that use localco-occurrence information use fixed-width word “windows” as opposed tosentences (e.g., skip-gram models). Fixed-width word windows ignoredsentence boundaries and do not address situations where the words couldbe very far apart, in the case of long sentences. Embodiments use aunique weighting not found in other approaches. They are also bettersuited for repeated words that are more common in longer contexts likethe length of a sentence. Embodiments herein also generate virtual termsthat may better account for multi-word expressions present in sentencecontexts.

Additionally, one or more embodiments represent improvements on termsincluding virtual terms or composite terms that can be used to createbetter topic, concept, and category definitions. Doing so can generatesignificant gains in lift for predictive modeling.

What is claimed is:
 1. A computer-program product tangibly embodied in anon-transitory machine-readable storage medium, the computer-programproduct including instructions operable to cause a computing system to:receive a collection comprising multiple sets of ordered terms, whereinthe multiple sets of ordered terms comprise a first set; generate adataset indicating an association between each pair of terms within asame set of the collection by: generating one or more co-occurrencescores for the first set, wherein a given co-occurrence score indicatesa frequency of co-occurrence of a given pair of terms within the firstset; generating computed probabilities based on the one or moreco-occurrence scores for the first set, wherein each of the computedprobabilities indicate a likelihood that one term in a given pair ofterms of the collection appears in a given set of the collection giventhat another term in the given pair of terms of the collection occurs;smoothing the computed probabilities by adding one or more randomobservations; and generating one or more association indications for thefirst set based on the smoothed computed probabilities, wherein arespective association indication of the one or more associationindications indicates an association between a respective pair of termswithin the first set; and output an indication of the dataset.
 2. Thecomputer-program product of claim 1, wherein the generating the computedprobabilities based on the one or more co-occurrence scores for thefirst set comprises: computing a first weighting, wherein the firstweighting is one of variable weights for the first set that varies basedon a respective distance between a respective pair of terms within thefirst set; and weighting a given co-occurrence score for the first setby applying the first weighting to the given co-occurrence score for thefirst set.
 3. The computer-program product of claim 2, wherein theinstructions are operable to cause a computing system to obtain avariable λ, where 0≤λ≤1; and wherein generating the first weighting(w_(ij)) comprises generating:w _(ij)=1/δ^(λ), where δ is the distance between term i and term j ofthe respective pair of terms.
 4. The computer-program product of claim3, wherein the generating the computed probabilities based on the one ormore co-occurrence scores for the first set comprises multiplying eachof weighted co-occurrence scores of the one or more co-occurrence scoresof the first set by a constant c such that an average of the one or moreco-occurrence scores for the first set corresponds to a value of
 1. 5.The computer-program product of claim 1, wherein the smoothing thecomputed probabilities comprises: receiving a parameter from a user ofthe computing system indicating a default level of random observations;adding the default level of random observations; and generating anassociation measure which is a modified normalized pointwise mutualinformation score based on the smoothed computed probabilities.
 6. Thecomputer-program product of claim 1, wherein generating a givenassociation indication of the one or more association indicationscomprises shifting an association measure by a variable pseudocountbased on how common the term pair is within the collection.
 7. Thecomputer-program product of claim 6, wherein the generating the one ormore association indications for the first set comprises computing anassociation indication for term i and term j (A_(ij)), wherein:$A_{ij} = {\frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {\overset{\hat{}}{P}\left( {i,j} \right)} \right)} - \frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {{{\overset{\hat{}}{P}\left( {i,j} \right)}X_{ij}} = 0} \right)}}$where: ∥D∥ is a number of sets of ordered terms in the collection; X_(i)is a number of sets in which term i occurred in the collection; X_(j) isa number of sets in which term j occurred in the collection; m is anumber of random observations; ${P_{i} = \frac{X_{i}}{D}};$${P_{j} = \frac{X_{j}}{D}};$ X_(ij) is a number of times terms i and joccur in the first set of the collection; and${\overset{\hat{}}{P}\left( {i,j} \right)} = {\frac{\left( {X_{ij} + {mP_{i}P_{j}}} \right)}{{D} + m}.}$8. The computer-program product of claim 1, wherein the multiple sets ofordered terms further comprise a second set that comprises more orderedterms than the first set; and wherein the instructions are operable tocause a computing system to: receive a variable parameter indicating anindicated maximum distance between ordered terms of a given set, whereina maximum distance between ordered terms of the first set is shorterthan the indicated maximum distance, and a maximum distance betweenordered terms of the second set is longer than the indicated maximumdifference; and generate the dataset by generating one or moreco-occurrence scores for the second set, wherein a given co-occurrencescore of the one or more co-occurrence scores for the second setindicates a frequency of co-occurrence of a given pair of terms withinthe second set within a certain distance apart set based on the variableparameter.
 9. The computer-program product of claim 1, wherein theinstructions are operable to cause a computing system to: receive one ormore settings for calculating the frequency of co-occurrence of a term iand a term j within the first set, wherein the one or more settingscomprise one or more of the following settings: an instruction whetherto consider a particular order of the term i and the term j; aninstruction whether term i and term j can be a same term; and a maximumvalue for a given co-occurrence score in the first set; and generate theone or more co-occurrence scores for the first set based on the one ormore settings.
 10. The computer-program product of claim 1, wherein theinstructions are operable to cause a computing system to: receive a termindication to treat term variations with equivalent stems or meanings asa same term; and generate the one or more co-occurrence scores for thefirst set based on the term indication.
 11. The computer-program productof claim 1, wherein the instructions are operable to cause a computingsystem to output an indication of the dataset by generating a singularvalue decomposition (SVD) for a sparse term-by-term matrix for each setof the collection.
 12. The computer-program product of claim 11, whereinthe instructions are operable to cause a computing system to output anindication of the dataset by generating topic data or predictivemodeling data based on a vector, or rotated vector, resulting from theSVD.
 13. The computer-program product of claim 1, wherein theinstructions are operable to cause a computing system to: compute anoffset table identifying a position for each term within the collection;and compute a terms table for each set of the collection indicating eachterm within a respective set, wherein replicated terms within a row orwithin a column for the respective set are excluded; and wherein thegenerating the one or more co-occurrence scores for the first setcomprises generating the one or more co-occurrence scores for the firstset based on the offset table and a respective terms table for the firstset.
 14. The computer-program product of claim 1, wherein the collectionrepresents text information and wherein terms of the multiple sets ofordered terms comprise tokens or combinations of tokens in the textinformation; and wherein the instructions are operable to cause acomputing system to determine the first set based on a clause orsentence boundary in the text information.
 15. The computer-programproduct of claim 14, wherein the instructions are operable to cause acomputing system to output an indication of the dataset by: determininga category, sentiment or meaning for the text information or a term inthe text information based on a given association indication of the oneor more association indications for the first set; and outputting thecategory, sentiment or meaning; and wherein the category, sentiment ormeaning are one of predefined possible options according to a predefinedmodel outcome.
 16. The computer-program product of claim 1, wherein thecollection represents text information or computer-generated data; andwherein the instructions are operable to cause a computing system todetermine the first set based on locating a symbol in the collection.17. The computer-program product of claim 1, wherein the collectionrepresents text information or computer-generated data associated withtime information; and wherein the instructions are operable to cause acomputing system to determine the first set based on a time periodindicated by the time information.
 18. The computer-program product ofclaim 1, wherein the generating the one or more co-occurrence scores forthe first set comprises generating at least one co-occurrence scorebetween a virtual term and another term of the first set, wherein thevirtual term is a single term that specifies at least two terms thatco-occur a variable distance apart.
 19. The computer-program product ofclaim 1, wherein the instructions are operable to cause a computingsystem to: distribute the collection across multiple computing nodes ofcomputing nodes in a computing network to generate data of identifiedterms that occurred with the collection; receive the generated data ofidentified terms; and generate the dataset by distributing the generateddata of identified terms across a same or different multiple ones of thecomputing nodes in the computing network such that an individual node ofthe multiple computing nodes receives all data associated with aparticular term of generated data of identified terms.
 20. Acomputer-implemented method comprising: receiving a collectioncomprising multiple sets of ordered terms, wherein the multiple sets ofordered terms comprise a first set; generating a dataset indicating anassociation between each pair of terms within a same set of thecollection by: generating one or more co-occurrence scores for the firstset, wherein a given co-occurrence score indicates a frequency ofco-occurrence of a given pair of terms within the first set; generatingcomputed probabilities based on the one or more co-occurrence scores forthe first set, wherein each of the computed probabilities indicate alikelihood that one term in a given pair of terms of the collectionappears in a given set of the collection given that another term in thegiven pair of terms of the collection occurs; smoothing the computedprobabilities by adding one or more random observations; and generatingone or more association indications for the first set based on thesmoothed computed probabilities, wherein a respective associationindication of the one or more association indications indicates anassociation between a respective pair of terms within the first set; andoutputting an indication of the dataset.
 21. The computer-implementedmethod of claim 20, wherein the generating the computed probabilitiesbased on the one or more co-occurrence scores for the first setcomprises: computing a first weighting, wherein the first weighting isone of variable weights for the first set that varies based on arespective distance between a respective pair of terms within the firstset; and weighting a given co-occurrence score for the first set byapplying the first weighting to the given co-occurrence score for thefirst set.
 22. The computer-implemented method of claim 21, wherein thecomputer-implemented method comprises obtaining a variable λ, where0≤λ≤1; and wherein generating the first weighting (w_(ij)) comprisesgenerating:w _(ij)=1/δ^(λ), where δ is the distance between term i and term j ofthe respective pair of terms.
 23. The computer-implemented method ofclaim 20, wherein the smoothing the computed probabilities comprises:receiving a parameter from a user of the computing system indicating adefault level of random observations; adding the default level of randomobservations; and generating an association measure which is a modifiednormalized pointwise mutual information score based on the smoothedcomputed probabilities.
 24. The computer-implemented method of claim 20,wherein generating a given association indication of the one or moreassociation indications comprises shifting an association measure by avariable pseudocount based on how common the term pair is within thecollection.
 25. The computer-implemented method of claim 24, wherein thegenerating the one or more association indications for the first setcomprises computing an association indication for term i and term j(A_(ij)), wherein:$A_{ij} = {\frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {\overset{\hat{}}{P}\left( {i,j} \right)} \right)} - \frac{\log \left( {P_{i}P_{j}} \right)}{\log \left( {{{\overset{\hat{}}{P}\left( {i,j} \right)}X_{ij}} = 0} \right)}}$where: ∥D∥ is a number of sets of ordered terms in the collection; X_(i)is a number of sets in which term i occurred in the collection; X_(j) isa number of sets in which term j occurred in the collection; m is anumber of random observations; ${P_{i} = \frac{X_{i}}{D}};$${P_{j} = \frac{X_{j}}{D}};$ X_(ij) is a number of times terms i and joccur in the first set of the collection; and${\overset{\hat{}}{P}\left( {i,j} \right)} = {\frac{\left( {X_{ij} + {mP_{i}P_{j}}} \right)}{{D} + m}.}$26. The computer-implemented method of claim 20, wherein the multiplesets of ordered terms further comprise a second set that comprises moreordered terms than the first set; wherein the computer-implementedmethod further comprises receiving a variable parameter indicating anindicated maximum distance between ordered terms of a given set, whereina maximum distance between ordered terms of the first set is shorterthan the indicated maximum distance, and a maximum distance betweenordered terms of the second set is longer than the indicated maximumdifference; and wherein the generating the dataset comprises generatingone or more co-occurrence scores for the second set, wherein a givenco-occurrence score of the one or more co-occurrence scores for thesecond set indicates a frequency of co-occurrence of a given pair ofterms within the second set within a certain distance apart set based onthe variable parameter.
 27. The computer-implemented method of claim 20,wherein the computer-implemented method further comprises receiving oneor more settings for calculating the frequency of co-occurrence of aterm i and a term j within the first set, wherein the one or moresettings comprise one or more of the following settings: an instructionwhether to consider a particular order of the term i and the term j; aninstruction whether term i and term j can be a same term; and a maximumvalue for a given co-occurrence score in the first set; and wherein thegenerating the one or more co-occurrence scores for the first setcomprises generating the one or more co-occurrence scores for the firstset based on the one or more settings.
 28. The computer-implementedmethod of claim 20, wherein the outputting an indication of the datasetcomprises generating a singular value decomposition (SVD) for a sparseterm-by-term matrix for each set of the collection.
 29. Thecomputer-implemented method of claim 20, wherein the collectionrepresents text information and wherein terms of the multiple sets ofordered terms comprise tokens or combinations of tokens in the textinformation; and wherein the computer-implemented method furthercomprises determining the first set based on a clause or sentenceboundary in the text information.
 30. A computing system comprisingprocessor and memory, the memory containing instructions executable bythe processor wherein the computing system is configured to: receive acollection comprising multiple sets of ordered terms, wherein themultiple sets of ordered terms comprise a first set; generate a datasetindicating an association between each pair of terms within a same setof the collection by: generating one or more co-occurrence scores forthe first set, wherein a given co-occurrence score indicates a frequencyof co-occurrence of a given pair of terms within the first set;generating computed probabilities based on the one or more co-occurrencescores for the first set, wherein the computed probabilities indicate alikelihood that one term in a given pair of terms of the collectionappears in a given set of the collection given that another term in thegiven pair of terms of the collection occurs; smoothing the computedprobabilities by adding one or more random observations; and generatingone or more association indications for the first set based on thesmoothed computed probabilities, wherein a respective associationindication of the one or more association indications indicates anassociation between a respective pair of terms within the first set; andoutput an indication of the dataset.